A branch-and-price-and-cut algorithm for the pattern minimization problem

DOI10.1051/RO:2008027MaRDI QIDQ3163667zbMATH OpenOpenAlexFDO

Authors Cláudio Alves, José Valério de Carvalho

Publication date 26 October 2010

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105413, http://hdl.handle.net/1822/59116

zbMATH Keywords

branch-and-boundcolumn generationcutting planesdual feasible functionsPattern Minimization Problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• New lower bounds based on column generation and constraint programming for the pattern minimization problem
• Pattern reduction in one-dimensional cutting stock problems
• Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
• Solution approaches for the cutting stock problem with setup cost

Cites work

• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• A simulated annealing heuristic for the one-dimensional cutting stock problem
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3999654 (Why is no real title available?)
• New classes of fast lower bounds for bin packing problems
• One-dimensional cutting stock problem to minimize the number of different patterns
• Optimal solutions for the cutting stock problem
• Pattern reduction in one-dimensional cutting stock problems

Cited in

(15)

• New lower bounds based on column generation and constraint programming for the pattern minimization problem
• A branch-and-price-and-cut method for computing an optimal bramble
• A branch-and-bound algorithm for the minimum cut linear arrangement problem
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm
• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
• On LP relaxations for the pattern minimization problem
• Solution approaches for the cutting stock problem with setup cost
• Optimal job splitting on a multi-slot machine with applications in the printing industry
• Cutting stock with no three parts per pattern: work-in-process and pattern minimization
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• A survey of dual-feasible and superadditive functions
• Random-key optimizer with reinforcement learning for the capacitated multi-period cutting stock problem with setup cost
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

Describes a project that uses

Uses Software

• CUTGEN1

This page was built for publication: A branch-and-price-and-cut algorithm for the pattern minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3163667)