A Linear Programming Approach to the Cutting-Stock Problem

@article{Gilmore1961ALP,
  title={A Linear Programming Approach to the Cutting-Stock Problem},
  author={P. Gilmore and R. Gomory},
  journal={Operations Research},
  year={1961},
  volume={9},
  pages={849-859}
}
The cutting-stock problem is the problem of filling an order at minimum cost for specified numbers of lengths of material to be cut from given stock lengths of given cost. When expressed as an integer programming problem the large number of variables involved generally makes computation infeasible. This same difficulty persists when only an approximate solution is being sought by linear programming. In this paper, a technique is described for overcoming the difficulty in the linear programming… Expand
1,813 Citations
Tighter relaxations for the cutting stock problem
  • 28
  • Highly Influenced
  • PDF
Optimal solutions for the cutting stock problem
  • 111
A New Linear Programming Approach to the Cutting Stock Problem
  • 153
Optimization of the Cutting Stock Process
  • 5
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
Programming of Economic Lot Sizes
  • 383
  • PDF
The Trim Problem
  • 117
Decomposition Principle for Linear Programs
  • 2,105
A MODEL FOR THE OPTIMAL PROGRAMMING OF RAILWAY FREIGHT TRAIN MOVEMENTS
  • 40
  • Highly Influential
Discrete-Variable Extremum Problems
  • 797
DANTZIG AND PHILIP WOLFE, "Decomposition Principle for Linear Programs,
  • Opns. Res
  • 1960
GOMORY, "An Algorithm for Integer Solutions to Linear Programs," Princeton-IBM Mathematics Research Project
  • Technical Report No
  • 1958
An algorithm for integer solutions to linear programs
  • 1,011
  • PDF
MANNE , " Programming of Economic Lot Sizes
  • Management Sci .
  • 1958
WHITIN, "A Dynamic Version of the Economic Lot
  • Size Model," Management Sci
  • 1958
...
1
2
...