In situ column generation for a cutting-stock problem
From MaRDI portal
Publication:868997
DOI10.1016/J.COR.2005.09.007zbMATH Open1149.90187OpenAlexW2069648634MaRDI QIDQ868997FDOQ868997
Authors: Jon Lee 
Publication date: 26 February 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.09.007
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- A Linear Programming Approach to the Cutting-Stock Problem
- The Decomposition Algorithm for Linear Programs
- Title not available (Why is that?)
- A new model for complete solutions to one-dimensional cutting stock problems.
- Pattern reduction in one-dimensional cutting stock problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A survey of very large-scale neighborhood search techniques
- Decomposition Principle for Linear Programs
- Pattern minimisation in cutting stock problems
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- One-dimensional cutting stock problem to minimize the number of different patterns
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Optimal solutions for the cutting stock problem
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- Fixed charge problems with identical fixed charges
- Pruning by isomorphism in branch-and-cut
- Exploiting orbits in symmetric ILP
- All-different polytopes
- On a binary-encoded ILP coloring formulation
- Cropped cubes
- Title not available (Why is that?)
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- Integer Programming and Combinatorial Optimization
Cited In (12)
- Sufficient condition for partial efficiency in a bicriteria nonlinear cutting stock problem
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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
Uses Software
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)
