LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
From MaRDI portal
Publication:4596192
DOI10.1007/978-3-319-42902-1_7zbMath1375.90262OpenAlexW2593396599MaRDI QIDQ4596192
Guntram Scheithauer, John 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
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (4)
The skiving stock problem and its relation to hypergraph matchings ⋮ 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 ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
This page was built for publication: LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap