Heuristic solution of open bin packing problems
From MaRDI portal
Publication:2567854
DOI10.1023/A:1009678411503zbMath1071.90576OpenAlexW1543543863MaRDI QIDQ2567854
Publication date: 13 October 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009678411503
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ A composite algorithm for multiprocessor scheduling ⋮ A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
This page was built for publication: Heuristic solution of open bin packing problems
