Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case

DOI10.1007/s10479-018-2762-xzbMath1434.90082OpenAlexW2783352089MaRDI QIDQ1730578

Guntram Scheithauer, John Martinovic

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-2762-x

zbMATH Keywords

cutting and packingskiving stock problemadditive integrality gapdivisible caseinteger round-down property

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• 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
• Probabilistic bounds for dual bin-packing
• Bin packing with divisible item sizes
• On-line and off-line approximation algorithms for vector covering problems
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• 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
• LP models for bin packing and cutting stock problems
• An exact algorithm for the dual bin packing problem
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
• 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
• The cutting stock problem and integer rounding
• A New Linear Programming Approach to the Cutting Stock Problem
• 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
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries

This page was built for publication: Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case