Integer Linear Programming
Formulating cutting & packing as a linear model over integer variables.
Also called: Integer Linear Programming · ILP · MILP · Mixed-Integer Linear Programming · 정수계획법
Last verified: 2026-05-27
The modeling layer from which exact cutting & packing methods depart (classified
as a method in v1). Writing placement, selection, and pattern decisions as
integer variables with linear constraints (positional and pattern formulations)
lets branch-and-bound or column-generation-based
branch-and-price find optimal solutions. ILP models and exact methods for
two-dimensional cutting & packing are surveyed by Lodi, Martello & Monaci (2002).
Claims & evidence
Every relationship is a claim with an equivalence level and an evidence grade. See the evidence policy.
| Relationship | Claim | Equiv. | Evidence | Sources |
|---|---|---|---|---|
| shares method withBranch and Bound | Integer linear programs are solved exactly by branch-and-bound — ILP is the model that states the problem, branch-and-bound the method that solves it. | E2 | A |
|
Neighborhood
Direct graph neighbors. Toggle depth to expand.