Accelerating column generation for variable sized bin-packing problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- A typology of cutting and packing problems
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- An improved typology of cutting and packing problems
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- Dual-Optimal Inequalities for Stabilized Column Generation
- Exact solution of bin-packing problems using column generation and branch-and-bound
- LP models for bin packing and cutting stock problems
- Lagrangian duality applied to the vehicle routing problem with time windows
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Near-optimal solutions to one-dimensional cutting stock problems
- On improvements to the analytic center cutting plane method
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- Stabilized column generation
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Using extra dual cuts to accelerate column generation
- Variable Sized Bin Packing
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
Cited in
(26)- Solving the variable size bin packing problem with discretized formulations
- An investigation into two bin packing problems with ordering and orientation implications
- Dual-Optimal Inequalities for Stabilized Column Generation
- Dual inequalities for stabilized column generation revisited
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
- An exact algorithm for the type-constrained and variable sized bin packing problem
- Heuristics for the variable sized bin-packing problem
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning
- The freight consolidation and containerization problem
- Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation
- The min-conflict packing problem
- Variable neighbourhood search for the variable sized bin packing problem
- An Improved Knapsack Solver for Column Generation
- Packing items to feed assembly lines
- Three-dimensional bin packing problem with variable bin height
- Relaxations and exact solution of the variable sized bin packing problem
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- An asymptotic approximation scheme for the concave cost bin packing problem
- Solutions diversification in a column generation algorithm
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
This page was built for publication: Accelerating column generation for variable sized bin-packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643963)
