In situ column generation for a cutting-stock problem

DOI10.1016/j.cor.2005.09.007zbMath1149.90187OpenAlexW2069648634MaRDI QIDQ868997

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

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A Polytope for a Product of Real Linear Functions in 0/1 Variables, 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, Sufficient condition for partial efficiency in a bicriteria nonlinear cutting stock problem, On global optimization with indefinite quadratics

Uses Software

• AMPL
• CPLEX
• XPRESS
• CUTGEN1

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• Fixed charge problems with identical fixed charges
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• Pruning by isomorphism in branch-and-cut
• Cropped cubes
• A new model for complete solutions to one-dimensional cutting stock problems.
• Exploiting orbits in symmetric ILP
• All-different polytopes
• Optimal solutions for the cutting stock problem
• One-dimensional cutting stock problem to minimize the number of different patterns
• Pattern minimisation in cutting stock problems
• On a Binary-Encoded ILP Coloring Formulation
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• The Decomposition Algorithm for Linear Programs
• Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• Pattern reduction in one-dimensional cutting stock problems
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
• Integer Programming and Combinatorial Optimization