Local search algorithms for the bin packing problem and their relationships to various construction heuristics
From MaRDI portal
(Redirected from Publication:1402503)
Recommendations
- New heuristics for one-dimensional bin-packing
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- scientific article; zbMATH DE number 4112059
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
Cited in
(10)- Locality-preserving allocations problems and coloured bin packing
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
- Energy efficient spatial TDMA scheduling in wireless networks
- The freight consolidation and containerization problem
- Adaptive large neighborhood search for solving the circle bin packing problem
- scientific article; zbMATH DE number 1983206 (Why is no real title available?)
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Heuristics for determining the number of warehouses for storing non-compatible products
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
This page was built for publication: Local search algorithms for the bin packing problem and their relationships to various construction heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402503)