Integer rounding and modified integer rounding for the skiving stock problem
From MaRDI portal
Publication:1751167
DOI10.1016/j.disopt.2016.06.004zbMath1387.90144OpenAlexW2476175584MaRDI QIDQ1751167
John Martinovic, Guntram Scheithauer
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2016.06.004
gapcutting and packingcontinuous relaxationskiving stock problem(modified) integer round down property
Integer programming (90C10) Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05)
Related Items (9)
A residual recombination heuristic for one-dimensional cutting stock problems ⋮ Integer linear programming models for the skiving stock problem ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ 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 ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory ⋮ 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
- Integer linear programming models for the skiving stock problem
- On the bin packing problem with a fixed number of object weights
- Cutting and packing optimization. Problems modeling and solution methods.
- Probabilistic bounds for dual bin-packing
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- Tighter relaxations for the cutting stock problem
- An exact algorithm for the dual bin packing problem
- Column generation for linear and integer programming
- A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Bin Packing via Discrepancy of Permutations
- On a dual version of the one-dimensional bin packing problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Probabilistic analysis of algorithms for dual bin packing problems
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
- A Logarithmic Additive Integrality Gap for Bin Packing
- The skiving stock problem as a counterpart of the cutting stock problem
This page was built for publication: Integer rounding and modified integer rounding for the skiving stock problem
