A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
- 30 April 2011
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 111 (10), 479-482
- https://doi.org/10.1016/j.ipl.2011.02.009
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Carathéodory bounds for integer conesOperations Research Letters, 2006
- New cases of the cutting stock problem having MIRUPMathematical Methods of Operations Research, 1998
- The modified integer round-up property of the one-dimensional cutting stock problemEuropean Journal of Operational Research, 1995
- Minkowski's Convex Body Theorem and Integer ProgrammingMathematics of Operations Research, 1987
- The cutting stock problem and integer roundingMathematical Programming, 1985
- A polynomial algorithm for integer programming covering problems satisfying the integer round-up propertyMathematical Programming, 1982
- Integer Rounding for Polymatroid and Branching Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1981
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961
- The Trim ProblemManagement Science, 1957