Integer linear programming models for the skiving stock problem

DOI10.1016/j.ejor.2015.11.005zbMath1346.90508OpenAlexW2115225494MaRDI QIDQ322686

Guntram Scheithauer, John Martinovic

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.11.005

zbMATH Keywords

modelingpackingdual bin packingcontinuous relaxationskiving stock problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (16)

The skiving stock problem and its relation to hypergraph matchings ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Exact solution of network flow models with strong relaxations ⋮ Tool switching problems with tool order constraints ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ 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 ⋮ 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 ⋮ An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case ⋮ An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case ⋮ A new interactive approach for solving fully fuzzy mixed integer linear programming ⋮ Improved flow-based formulations for the skiving stock problem

Uses Software

• CUTGEN1

Cites Work

• Unnamed Item
• Cutting and packing optimization. Problems modeling and solution methods.
• Probabilistic bounds for dual bin-packing
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Integer rounding and modified integer rounding for the skiving stock problem
• LP models for bin packing and cutting stock problems
• An exact algorithm for the dual bin packing problem
• 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
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• Mathematical Methods of Organizing and Planning Production
• Using Extra Dual Cuts to Accelerate Column Generation
• On a dual version of the one-dimensional bin packing problem
• Probabilistic analysis of algorithms for dual bin packing problems
• Dual-Optimal Inequalities for Stabilized Column Generation
• A New Linear Programming Approach to the Cutting Stock Problem
• Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• The skiving stock problem as a counterpart of the cutting stock problem

This page was built for publication: Integer linear programming models for the skiving stock problem