Saxo Access
Indkøbskurv
  3. Branch and Bound Methods for Combinatorial Problems
Branch and Bound Methods for Combinatorial Problems (e-bog) af Little, John D. C.
Little, John D. C. (forfatter)

Branch and Bound Methods for Combinatorial Problems e-bog

59,77 DKK (inkl. moms 74,71 DKK)
Whilst the greatest effort has been made to ensure the quality of this text, due to the historical nature of this content, in some rare cases there may be minor issues with legibility. Certain types of combinatorial problems is discussed. The approach is illustrated on the traveling salesman problem. A 6 city problem is worked out in detail. Then a flow diagram is given for a general discrete v...
E-bog 59,77 DKK
Kan læses i vores apps til iPhone/iPad og Android.
Forfattere Little, John D. C. (forfatter)
Forlag Forgotten Books
Udgivet 27 november 2019
Genrer PBKA
Sprog English
Format pdf
Beskyttelse LCP
ISBN 9780259723479

Beskrivelse

Whilst the greatest effort has been made to ensure the quality of this text, due to the historical nature of this content, in some rare cases there may be minor issues with legibility. Certain types of combinatorial problems is discussed. The approach is illustrated on the traveling salesman problem. A 6 city problem is worked out in detail. Then a flow diagram is given for a general discrete variable minimization problem. Finally, applications in job sequencing, flow-shop scheduling, and traffic.