Dansk
Little, John D. C.
(forfatter)
Branch and Bound Methods for Combinatorial Problems e-bog
59,77 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 var…
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.
E-bog
59,77 DKK
Forlag
Forgotten Books
Udgivet
27.11.2019
Genrer
PBKA
Sprog
English
Format
pdf
Beskyttelse
LCP
ISBN
9780259723479
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.