An improved upper bound for the gap of skiving stock instances of the divisible case

DOI10.1007/978-3-319-89920-6_25MaRDI QIDQ4685755zbMATH OpenOpenAlexFDO

Authors Guntram Scheithauer, J. Martinovic

Publication date 9 October 2018

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-89920-6_25

zbMATH Keywords

cutting and packingdivisible casegap best fit decreasingskiving stock problem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Production models (90B30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
• 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
• Integer rounding and modified integer rounding for the skiving stock problem

Cites work

• A heuristic for the skiving and cutting stock problem in paper and plastic film industries
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• Integer linear programming models for the skiving stock problem
• Integer rounding and modified integer rounding for the skiving stock problem
• On a dual version of the one-dimensional bin packing problem
• The proper relaxation and the proper gap of the skiving stock problem
• The skiving stock problem as a counterpart of the cutting stock problem

Cited in

(5)

• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• Improved flow-based formulations for the skiving stock problem
• LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
• The proper relaxation and the proper gap of the skiving stock problem

This page was built for publication: An improved upper bound for the gap of skiving stock instances of the divisible case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685755)