The skiving stock problem as a counterpart of the cutting stock problem

DOI10.1111/1475-3995.00433MaRDI QIDQ4814101zbMATHOpenAlexFDO

Authors

Publication date 7 September 2004

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/1475-3995.00433

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Integer programming (90C10)

Recommendations

• LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
• Integer linear programming models for the skiving stock problem
• The proper relaxation and the proper gap of the skiving stock problem
• Improved flow-based formulations for the skiving stock problem
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry

Cites work

• A polynomially solvable special case of the unbounded knapsack problem
• An exact algorithm for the dual bin packing problem
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• Cutting and Reuse: An Application from Automobile Component Manufacturing
• Reflections and projections on creativity in operations research and management science: A pressing need for a shift in paradigm
• Row and column generation technique for a multistage cutting stock problem
• The modified integer round-up property of the one-dimensional cutting stock problem

Cited in

(16)

• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
• The skiving stock problem and its relation to hypergraph matchings
• Integer rounding and modified integer rounding for the skiving stock problem
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• New cases of the cutting stock problem having MIRUP
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
• Improved flow-based formulations for the skiving stock problem
• Large proper gaps in bin packing and dual bin packing problems
• Integer linear programming models for the skiving stock problem
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• The proper relaxation and the proper gap of the skiving stock problem
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• An improved upper bound for the gap of skiving stock instances of the divisible case

This page was built for publication: The skiving stock problem as a counterpart of the cutting stock problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4814101)