LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap

DOI10.1007/978-3-319-42902-1_7MaRDI QIDQ4596192zbMATH OpenOpenAlexFDO

Authors Guntram Scheithauer, J. Martinovic

Publication date 1 December 2017

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

Full work available at URL https://doi.org/10.1007/978-3-319-42902-1_7

zbMATH Keywords

gapcutting and packingcontinuous relaxationskiving stock problemresidual instances

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Integer linear programming models for the skiving stock problem
• Tighter relaxations for the cutting stock problem
• An improved upper bound for the gap of skiving stock instances of the divisible case
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
• scientific article; zbMATH DE number 827989
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
• LP models for bin packing and cutting stock problems
• Improved flow-based formulations for the skiving stock problem
• An LP-based approach to a two-stage cutting stock problem
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case

Cited in

(10)

• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
• Large proper gaps in bin packing and dual bin packing problems
• An improved upper bound for the gap of 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
• The skiving stock problem as a counterpart of the cutting stock problem
• Integer linear programming models for the skiving stock problem
• The skiving stock problem and its relation to hypergraph matchings
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
• The proper relaxation and the proper gap of the skiving stock problem

This page was built for publication: LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap

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