Accelerating column generation for variable sized bin-packing problems
From MaRDI portal
Publication:2643963
DOI10.1016/j.ejor.2005.07.033zbMath1135.90024OpenAlexW2048274357MaRDI QIDQ2643963
Cláudio Alves, José M. Valério de Carvalho
Publication date: 27 August 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.07.033
Related Items (20)
Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ Packing items to feed assembly lines ⋮ Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning ⋮ A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ An investigation into two bin packing problems with ordering and orientation implications ⋮ An asymptotic approximation scheme for the concave cost bin packing problem ⋮ Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items ⋮ Solving the variable size bin packing problem with discretized formulations ⋮ 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 freight consolidation and containerization problem ⋮ The min-conflict packing problem ⋮ Variable neighbourhood search for the variable sized bin packing problem ⋮ An exact algorithm for the type-constrained and variable sized bin packing problem ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ Heuristics for the variable sized bin-packing problem ⋮ Three-dimensional bin packing problem with variable bin height
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Near-optimal solutions to one-dimensional cutting stock problems
- On improvements to the analytic center cutting plane method
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Stabilized column generation
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- A typology of cutting and packing problems
- 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
- Lagrangian duality applied to the vehicle routing problem with time windows
- An improved typology of cutting and packing problems
- Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
- Mathematical Methods of Organizing and Planning Production
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- Using Extra Dual Cuts to Accelerate Column Generation
- A Linear Programming Approach to the Cutting-Stock Problem
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Dual-Optimal Inequalities for Stabilized Column Generation
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: Accelerating column generation for variable sized bin-packing problems
