Algorithms for the variable sized bin packing problem
From MaRDI portal
Publication:1869719
DOI10.1016/S0377-2217(02)00247-3zbMATH Open1031.90027MaRDI QIDQ1869719FDOQ1869719
Authors: Jangha Kang, Sungsoo Park 
Publication date: 28 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Title not available (Why is that?)
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Bin packing with divisible item sizes
Cited In (49)
- A desired load distribution model for scheduling of unrelated parallel machines
- Vehicle scheduling under the warehouse-on-wheels policy
- Bin packing with divisible item sizes
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
- Algorithm NextFit for the bin packing problem
- An investigation into two bin packing problems with ordering and orientation implications
- Optimum service capacity and demand management with price incentives
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Variable Sized Bin Packing
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- A storage-size selection problem
- ATM VP-based network design
- Heuristics for the dynamic facility location problem with modular capacities
- Queue-constrained packing: a vehicle ferry case study
- A bin packing approach to solve the aircraft maintenance task allocation problem
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
- The vehicle routing problem with heterogeneous locker boxes
- Efficient algorithms for the offline variable sized bin-packing problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Online packing of arbitrary sized items into designated and multipurpose bins
- 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
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- An improved typology of cutting and packing problems
- A tabu search algorithm for application placement in computer clustering
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning
- The freight consolidation and containerization problem
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
- Variable neighbourhood search for the variable sized bin packing problem
- Packing items to feed assembly lines
- A greedy heuristic for 3-partitioning with similar elements
- Approximation algorithms for a virtual machine allocation problem with finite types
- 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
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Variable-sized object packing and its applications to instruction cache design
- Title not available (Why is that?)
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
- Truthful mechanism design for bin packing with applications on cloud computing
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
- Solving the variable size bin packing problem with discretized formulations
This page was built for publication: Algorithms 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 Q1869719)
