OPTIMIZATION
Edited by G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd
CHAPTER 6
Integer Programming
G.L. Nemhauser and L.A. Wolsey
1. Introduction*
2. Integer programming models
3. Choices in model formulation
4. Properties of integral polyhedra and computational complexity
5. Relaxation and valid inequalities
6. Duality
7. Cutting plane algorithms
8. Branch-and-bound
9. Heuristics
10. Notes
References
* The first two pages of the chapters are available as PDF file.
Complete chapters on ScienceDirect
[Description and order information]