Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory

DOI10.1080/02331934.2018.1494171zbMath1416.90043OpenAlexW2853582334MaRDI QIDQ4646531

Guntram Scheithauer, John Martinovic

Publication date: 14 January 2019

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2018.1494171

zbMATH Keywords

cutting and packingpolyhedral theoryskiving stock problemadditive integrality gapinteger round-down property

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
• Large gaps in one-dimensional cutting stock problems
• Probabilistic bounds for dual bin-packing
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Solving binary cutting stock problems by column generation and branch- and-bound
• On-line and off-line approximation algorithms for vector covering problems
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• 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
• 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
• Cutting and Reuse: An Application from Automobile Component Manufacturing
• Integer Rounding for Polymatroid and Branching Optimization Problems
• The cutting stock problem and integer rounding
• 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
• On the Solution of Generalized Spectrum Allocation Problems
• The skiving stock problem as a counterpart of the cutting stock problem
• Column Generation

This page was built for publication: Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory