Algorithms for the variable sized bin packing problem
From MaRDI portal
Publication:1869719
DOI10.1016/S0377-2217(02)00247-3zbMath1031.90027MaRDI QIDQ1869719
Publication date: 28 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (39)
Vehicle scheduling under the warehouse-on-wheels policy ⋮ A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ Packing items to feed assembly lines ⋮ An improved typology of cutting and packing problems ⋮ A tabu search algorithm for application placement in computer clustering ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Optimum service capacity and demand management with price incentives ⋮ ATM VP-based network design ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ 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 ⋮ Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties ⋮ Approximation algorithms for a virtual machine allocation problem with finite types ⋮ 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 ⋮ A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems ⋮ 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 ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ Solving the variable size bin packing problem with discretized formulations ⋮ A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints ⋮ Online packing of arbitrary sized items into designated and multipurpose bins ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ The freight consolidation and containerization problem ⋮ Variable neighbourhood search for the variable sized bin packing problem ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ Heuristics for the dynamic facility location problem with modular capacities ⋮ 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 ⋮ A desired load distribution model for scheduling of unrelated parallel machines ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Truthful mechanism design for bin packing with applications on cloud computing
Cites Work
- Unnamed Item
- Bin packing with divisible item sizes
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
This page was built for publication: Algorithms for the variable sized bin packing problem
