The proper relaxation and the proper gap of the skiving stock problem
From MaRDI portal
Publication:510433
DOI10.1007/s00186-016-0552-2zbMath1394.90489OpenAlexW2472156964MaRDI QIDQ510433
John Martinovic, Guntram Scheithauer
Publication date: 10 February 2017
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-016-0552-2
Integer programming (90C10) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (12)
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 ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ 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 ⋮ 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 ⋮ Dividing splittable goods evenly and with limited fragmentation
Cites Work
- Unnamed Item
- Integer linear programming models for the skiving stock problem
- Bin packing and related problems: general arc-flow formulation with graph compression
- The proper relaxation and the proper gap of the skiving stock problem
- Cutting and packing optimization. Problems modeling and solution methods.
- Probabilistic bounds for dual bin-packing
- An instance of the cutting stock problem for which the rounding property does not hold
- Worst-case analyses, linear programming and the bin-packing problem
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- Tighter relaxations for the cutting stock problem
- LP models for bin packing and cutting stock problems
- An exact algorithm for the dual bin packing problem
- 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
- Mathematical Methods of Organizing and Planning Production
- 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
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
- The skiving stock problem as a counterpart of the cutting stock problem
This page was built for publication: The proper relaxation and the proper gap of the skiving stock problem
