Integer linear programming models for the skiving stock problem
From MaRDI portal
(Redirected from Publication:322686)
Recommendations
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
- Integer rounding and modified integer rounding for the skiving stock problem
- Improved flow-based formulations for the skiving stock problem
- The proper relaxation and the proper gap of the skiving stock problem
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
Cites work
- scientific article; zbMATH DE number 2132174 (Why is no real title available?)
- A New Linear Programming Approach to the Cutting Stock Problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
- An exact algorithm for the dual bin packing problem
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
- Cutting and packing optimization. Problems modeling and solution methods.
- Dual-Optimal Inequalities for Stabilized Column Generation
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- 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
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- On a dual version of the one-dimensional bin packing problem
- Probabilistic analysis of algorithms for dual bin packing problems
- Probabilistic bounds for dual bin-packing
- The skiving stock problem as a counterpart of the cutting stock problem
- Using extra dual cuts to accelerate column generation
Cited in
(19)- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- The skiving stock problem and its relation to hypergraph matchings
- Integer rounding and modified integer rounding for the skiving stock problem
- 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
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
- A new interactive approach for solving fully fuzzy mixed integer linear programming
- Tool switching problems with tool order constraints
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- Improved flow-based formulations for the skiving stock problem
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- The skiving stock problem as a counterpart of the cutting stock problem
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
- The proper relaxation and the proper gap of the skiving stock problem
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- An improved upper bound for the gap of skiving stock instances of the divisible case
This page was built for publication: Integer linear programming models for the skiving stock problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322686)
