Integer and Combinatorial Programming
Cutting planes, branch-and-cut, and Lagrangian relaxation.
Integer and Combinatorial Programming. Cutting planes, branch-and-cut, and Lagrangian relaxation.
Foundations and canonical references
The standard treatments of integer and combinatorial programming approach the subject from complementary angles. Wolsey, Integer Programming (1998) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to. Nemhauser, Integer and Combinatorial Optimization (1988) gives a parallel, more proof-oriented exposition of the same material and is widely used as a graduate text.
Open methodological questions for integer and combinatorial programming include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- textbook · primary · 1998Integer Programmingwolsey-1998
- textbook · primary · 1988Integer and Combinatorial Optimizationnemhauser-1988, wolsey-1988
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.