previous contents next
1. Introduction
2. Is IP a Suitable Technique?
3. Discrete Variables
3.1 Integer Variables
3.2 Binary Variables
3.3 Using a Binary Variable
4. Semi-continuous Variables
5. Sets of Decision Variables
6. Special Ordered Sets of Type 2
7. How Integer Programming Codes Work
8. Guiding the Search
8.1 Decisions which the IP Code Takes
8.2 Special Ordered Sets
8.3 Priorities
8.4 Controlling the Shape of the Search
8.5 Targets and Cutoff
8.6 Assisting the Estimation
9. Advanced Integer Programming
9.1 Travelling Salesman Problem
9.2 Cutting-Stock Problems
9.3 Aircrew Scheduling
9.4 Intersections of Decisions
9.5 A Machine Scheduling Example
