Heuristics for the variable sized bin-packing problem
From MaRDI portal
Publication:1017465
DOI10.1016/J.COR.2008.12.016zbMATH Open1160.90634OpenAlexW2044180942MaRDI QIDQ1017465FDOQ1017465
Authors: 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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- On genetic algorithms for the packing of polygons
- Modified subset sum heuristics for bin packing
- A genetic algorithm for the set covering problem
- Worst-case analysis of the subset sum algorithm for bin packing.
- Algorithms for the variable sized bin packing problem
- The two-dimensional bin packing problem with variable bin sizes and costs
- Accelerating column generation for variable sized bin-packing problems
- A set-covering-based heuristic approach for bin-packing problems
- Heuristics for the variable sized bin-packing problem
- A Lagrangian-based heuristic for large-scale set covering problems
- Algorithms for railway crew management
- A Heuristic Method for the Set Covering Problem
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
- Variable Sized Bin Packing
- A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- Bin packing with divisible item sizes
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
Cited In (30)
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Mixed-integer linear programming heuristics for the prepack optimization problem
- An investigation into two bin packing problems with ordering and orientation implications
- A generalized bin packing problem for parcel delivery in last-mile logistics
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- A bin packing approach to solve the aircraft maintenance task allocation problem
- Algorithms for the variable sized bin packing problem
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- Sum-of-squares heuristics for bin packing and memory allocation
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
- The vehicle routing problem with heterogeneous locker boxes
- Minimizing the number of stations and station activation costs for a production line
- Efficient algorithms for the offline variable sized bin-packing problem
- An exact algorithm for the type-constrained and variable sized bin packing problem
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- 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
- The freight consolidation and containerization problem
- New heuristics for one-dimensional bin-packing
- Exact and approximate methods for the score-constrained packing problem
- Variable neighbourhood search for the variable sized bin packing problem
- On the Impact of Fuzzy Constraints in the Variable Size and Cost Bin Packing Problem
- Packing items to feed assembly lines
- Title not available (Why is that?)
- 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
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- 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
- Solving the variable size bin packing problem with discretized formulations
Uses Software
This page was built for publication: Heuristics for the variable sized bin-packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017465)
