Solving the one-dimensional bin packing problem with a weight annealing heuristic
From MaRDI portal
Publication:2468485
DOI10.1016/j.cor.2006.10.021zbMath1177.90347MaRDI QIDQ2468485
Bruce L. Golden, Edward A. Wasil, Kok-Hua Loh
Publication date: 23 January 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.10.021
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Exact solution of bin-packing problems using column generation and branch-and-bound
- The noising method: A new method for combinatorial optimization
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Guided local search and its application to the traveling salesman problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- New classes of fast lower bounds for bin packing problems
- New heuristics for one-dimensional bin-packing