Abstract
An integer programming problem is said to have the integer round-up property if its optimal value is given by the least integer greater than or equal to the optimal value of its linear programming relaxation. In this paper we prove that certain classes of cutting stock problems have the integer round-up property. The proof of these results relies upon the decomposition properties of certain knapsack polyhedra.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Baum and L.E. Trotter, Jr., “Integer rounding for polymatroid and branching optimization problems”,SIAM Journal on Algebraic and Discrete Methods 2 (1981) 416–425.
C. Berge and E.L. Johnson, “Coloring the edges of a hypergraph and linear programming techniques”, Research Report CORR 76/4, Department of Combinatorics and Optimization, University of Waterloo (Waterloo, Ontario, 1976).
D. Gale,The theory of linear economic models (McGraw-Hill, New York, 1960).
O. Marcotte, “Topics in combinatorial packing and covering”, Technical Report No. 568, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1982).
Author information
Authors and Affiliations
Additional information
This research was partially supported by National Science Foundation grants ECS-8005350 and 81-13534 to Cornell University.
Rights and permissions
About this article
Cite this article
Marcotte, O. The cutting stock problem and integer rounding. Mathematical Programming 33, 82–92 (1985). https://doi.org/10.1007/BF01582013
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582013