A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
From MaRDI portal
Publication:941555
DOI10.1016/J.COR.2006.08.014zbMath1163.90702OpenAlexW2101999355MaRDI QIDQ941555
Cláudio Alves, José M. Valério de Carvalho
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.08.014
column generationbranch-and-price-and-cutmultiple length cutting stockstabilization of column generation
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (31)
A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling ⋮ Exact algorithms for the bin packing problem with fragile objects ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint ⋮ A note on branch-and-cut-and-price ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ Exact solution of network flow models with strong relaxations ⋮ Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items ⋮ The generalized assortment and best cutting stock length problems ⋮ Solving the variable size bin packing problem with discretized formulations ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ The min-conflict packing problem ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Efficient algorithms for real-life instances of the variable size bin packing problem ⋮ Lower bounds for three-dimensional multiple-bin-size bin packing problems ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ Solving bin packing problems using VRPSolver models ⋮ Dual Inequalities for Stabilized Column Generation Revisited ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ The one-dimensional cutting stock problem with due dates ⋮ Strips minimization in two-dimensional cutting stock of circular items
Uses Software
Cites Work
- Near-optimal solutions to one-dimensional cutting stock problems
- Bin packing with divisible item sizes
- A sequential heuristic procedure for one-dimensional cutting
- Heuristic algorithms for the multiple knapsack problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Optimization of roll cutting in clothing industry
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- Optimal solutions for the cutting stock problem
- LP models for bin packing and cutting stock problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- Algorithms for the variable sized bin packing problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
- Mathematical Methods of Organizing and Planning Production
- Using Extra Dual Cuts to Accelerate Column Generation
- Dual-Optimal Inequalities for Stabilized Column Generation
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
