Two heuristics for the one-dimensional bin-packing problem
From MaRDI portal
Publication:1018262
DOI10.1007/s00291-006-0071-2zbMath1168.90598MaRDI QIDQ1018262
Publication date: 19 May 2009
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-006-0071-2
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem, A metaheuristic for the fixed job scheduling problem under spread time constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lower bounds and reduction procedures for the bin packing problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Hybrid evolutionary algorithms for graph coloring
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- New heuristics for one-dimensional bin-packing