Improved flow-based formulations for the skiving stock problem
From MaRDI portal
Publication:2333124
DOI10.1016/j.cor.2019.104770zbMath1458.90554OpenAlexW2969281395MaRDI QIDQ2333124
Publication date: 11 November 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11380/1186980
Related Items (7)
A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Half-cycle: a new formulation for modelling kidney exchange problems ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ 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 ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications
Uses Software
Cites Work
- 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
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- The skiving stock problem and its relation to hypergraph matchings
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- BPPLIB: a library for bin packing and cutting stock problems
- 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
- Large proper gaps in bin packing and dual bin packing problems
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- An improved typology of cutting and packing problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Mathematical Methods of Organizing and Planning Production
- Dual Inequalities for Stabilized Column Generation Revisited
- On a dual version of the one-dimensional bin packing problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- An Algorithm for Two-Dimensional Cutting Problems
- 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
- Cutting and Packing Problems with Placement Constraints
- The G4-Heuristic for the Pallet Loading Problem
- The skiving stock problem as a counterpart of the cutting stock problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries
This page was built for publication: Improved flow-based formulations for the skiving stock problem
