The skiving stock problem as a counterpart of the cutting stock problem
From MaRDI portal
Publication:4814101
DOI10.1111/1475-3995.00433zbMath1108.90327OpenAlexW2056743362MaRDI QIDQ4814101
No author found.
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
Related Items (14)
Integer linear programming models for the skiving stock problem ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ Large proper gaps in bin packing and dual bin packing problems ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ The proper relaxation and the proper gap of the skiving stock problem ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory ⋮ 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 ⋮ An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case ⋮ An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case ⋮ Improved flow-based formulations for the skiving stock problem
Cites Work
- The modified integer round-up property of the one-dimensional cutting stock problem
- Row and column generation technique for a multistage cutting stock problem
- An exact algorithm for the dual bin packing problem
- Reflections and Projections on Creativity in Operations Research and Management Science: A Pressing Need for a Shift in Paradigm
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
- A polynomially solvable special case of the unbounded knapsack problem
This page was built for publication: The skiving stock problem as a counterpart of the cutting stock problem