Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
From MaRDI portal
Publication:6157429
Recommendations
- Improved flow-based formulations for the skiving stock problem
- Integer linear programming models for the skiving stock problem
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- Cutting Stock Problems
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3573595 (Why is no real title available?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Linear Programming Approach to the Cutting Stock Problem
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries
- An exact algorithm for the dual bin packing problem
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Benchmarking optimization software with performance profiles.
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing 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
- Column Generation
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- Dual inequalities for stabilized column generation revisited
- Dual-Optimal Inequalities for Stabilized Column Generation
- Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Exact solution of network flow models with strong relaxations
- Friendly bin packing instances without integer round-up property
- Improved flow-based formulations for the skiving stock problem
- Integer linear programming models for the skiving stock problem
- Integer rounding and modified integer rounding for the skiving stock problem
- Introduction to algorithms.
- LP models for bin packing and cutting stock problems
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- On a dual version of the one-dimensional bin packing problem
- Path-reduced costs for eliminating arcs in routing and scheduling
- Stabilized branch-and-price algorithms for vector packing problems
- The proper relaxation and the proper gap of the skiving stock problem
- The skiving stock problem as a counterpart of the cutting stock problem
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- Using extra dual cuts to accelerate column generation
Cited in
(3)
This page was built for publication: Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157429)
