In situ column generation for a cutting-stock problem
From MaRDI portal
Recommendations
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- The cutting stock problem in a hardboard industry: A case study.
- Cutting Stock Problems
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3999654 (Why is no real title available?)
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A new model for complete solutions to one-dimensional cutting stock problems.
- A survey of very large-scale neighborhood search techniques
- All-different polytopes
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Cropped cubes
- Decomposition Principle for Linear Programs
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Exploiting orbits in symmetric ILP
- Fixed charge problems with identical fixed charges
- Integer Programming and Combinatorial Optimization
- On a binary-encoded ILP coloring formulation
- One-dimensional cutting stock problem to minimize the number of different patterns
- Optimal solutions for the cutting stock problem
- Pattern minimisation in cutting stock problems
- Pattern reduction in one-dimensional cutting stock problems
- Pruning by isomorphism in branch-and-cut
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The Decomposition Algorithm for Linear Programs
Cited in
(12)- Sufficient condition for partial efficiency in a bicriteria nonlinear cutting stock problem
- scientific article; zbMATH DE number 3916002 (Why is no real title available?)
- A polytope for a product of real linear functions in 0/1 variables
- A note on ``Reducing the number of binary variables in cutting stock problems
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- A column generation procedure for gang-rip saw arbor design and scheduling
- scientific article; zbMATH DE number 5299948 (Why is no real title available?)
- On global optimization with indefinite quadratics
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
- Computational study of a column generation algorithm for bin packing and cutting stock problems
This page was built for publication: In situ column generation for a cutting-stock problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868997)
