Tighter relaxations for the cutting stock problem

DOI10.1016/S0377-2217(97)00404-9zbMath0933.90053MaRDI QIDQ1806682

Guntram Scheithauer, Johannes Terno, Christoph Nitsche

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer linear programminglinear programming relaxationcutting stock probleminteger round-up property

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Families of non-IRUP instances of the one-dimensional cutting stock problem, Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, The skiving stock problem and its relation to hypergraph matchings, Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost, Large proper gaps in bin packing and dual bin packing problems, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, The proper relaxation and the proper gap of the skiving stock problem, Integer rounding and modified integer rounding for the skiving stock problem, A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems, A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths, Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

Cites Work

• An instance of the cutting stock problem for which the rounding property does not hold
• The modified integer round-up property of the one-dimensional cutting stock problem
• New cases of the cutting stock problem having MIRUP
• Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
• A Linear Programming Approach to the Cutting-Stock Problem
• Integer Rounding for Polymatroid and Branching Optimization Problems
• The cutting stock problem and integer rounding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item