Heuristics for the variable sized bin-packing problem
From MaRDI portal
Publication:1017465
DOI10.1016/j.cor.2008.12.016zbMath1160.90634OpenAlexW2044180942MaRDI QIDQ1017465
Mohamed Haouari, Mehdi Serairi
Publication date: 19 May 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.12.016
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (18)
A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ Minimizing the number of stations and station activation costs for a production line ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ 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 ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Efficient algorithms for the offline 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 branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ A generalized bin packing problem for parcel delivery in last-mile logistics ⋮ The freight consolidation and containerization problem ⋮ Efficient algorithms for real-life instances of the variable size bin packing problem ⋮ Variable neighbourhood search for the variable sized bin packing problem ⋮ A bin packing approach to solve the aircraft maintenance task allocation problem ⋮ The vehicle routing problem with heterogeneous locker boxes ⋮ Heuristics for the variable sized bin-packing problem
Uses Software
Cites Work
- Unnamed Item
- Heuristics for the variable sized bin-packing problem
- Modified subset sum heuristics for bin packing
- Bin packing with divisible item sizes
- On genetic algorithms for the packing of polygons
- A genetic algorithm for the set covering problem
- A Lagrangian-based heuristic for large-scale set covering problems
- Algorithms for railway crew management
- Worst-case analysis of the subset sum algorithm for bin packing.
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Algorithms for the variable sized bin packing problem
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- The two-dimensional bin packing problem with variable bin sizes and costs
- Accelerating column generation for variable sized bin-packing problems
- Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- A Heuristic Method for the Set Covering Problem
This page was built for publication: Heuristics for the variable sized bin-packing problem
