Branch and Bound Methods for Combinatorial Problems

by John D.C. Little

Excerpt from Branch and Bound Methods for Combinatorial Problems
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.

About the author

John Dutton Conant Little was an Institute Professor at the Massachusetts Institute of Technology best known for his result in operations research, Little's law.