Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
From MaRDI portal
Publication:6157429
DOI10.1016/j.dam.2023.04.003zbMath1518.90090OpenAlexW4366608284MaRDI QIDQ6157429
John Martinovic, Laura Korbacher, Nico Strasdat, Stefan Irnich
Publication date: 11 May 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.04.003
Cites Work
- 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
- Bin packing and related problems: general arc-flow formulation with graph compression
- The proper relaxation and the proper gap of the skiving stock problem
- Stabilized branch-and-price algorithms for vector packing problems
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- 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
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- An exact algorithm for the dual bin packing problem
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Improved flow-based formulations for the skiving stock problem
- 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
- Exact solution of network flow models with strong relaxations
- Mathematical Methods of Organizing and Planning Production
- Dual Inequalities for Stabilized Column Generation Revisited
- Using Extra Dual Cuts to Accelerate Column Generation
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- On a dual version of the one-dimensional bin packing problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Dual-Optimal Inequalities for Stabilized Column Generation
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- A New Linear Programming Approach to the Cutting Stock Problem
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- The skiving stock problem as a counterpart of the cutting stock problem
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
- Benchmarking optimization software with performance profiles.
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries
This page was built for publication: Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
