An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
From MaRDI portal
Publication:2012070
DOI10.1016/j.dam.2017.05.015zbMath1376.90020OpenAlexW2666990287MaRDI QIDQ2012070
Guntram Scheithauer, John Martinovic
Publication date: 27 July 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.05.015
Numerical optimization and variational techniques (65K10) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (4)
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
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- The proper relaxation and the proper gap of the skiving stock problem
- Cutting and packing optimization. Problems modeling and solution methods.
- Large gaps in one-dimensional cutting stock problems
- Probabilistic bounds for dual bin-packing
- An instance of the cutting stock problem for which the rounding property does not hold
- Bin packing with divisible item sizes
- The modified integer round-up property of the one-dimensional cutting stock problem
- Families of non-IRUP instances of the one-dimensional 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
- Friendly bin packing instances without integer round-up property
- 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
- An improved typology of cutting and packing problems
- 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
- Windows scheduling as a restricted version of bin packing
- 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: An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
