Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
From MaRDI portal
Publication:531429
DOI10.1016/j.ejor.2010.11.004zbMath1219.90140OpenAlexW1982723520MaRDI QIDQ531429
Krzysztof Fleszar, Christoforos Charalambous
Publication date: 29 April 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.11.004
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Bin packing and cutting stock problems: mathematical models and exact algorithms, A grouping genetic algorithm with controlled gene transmission for the bin packing problem, Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, Lower bounds and algorithms for the minimum cardinality bin covering problem, Bin packing problem with conflicts and item fragmentation, A hybrid evolutionary algorithm for the offline Bin Packing Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- New bin packing fast lower bounds
- Two heuristics for the one-dimensional bin-packing problem
- Modified subset sum heuristics for bin packing
- 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
- Worst-case analysis of the subset sum algorithm for bin packing.
- LP models for bin packing and cutting stock problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Computing the asymptotic worst-case of bin packing lower bounds
- Analysis of a Compound Bin Packing Algorithm
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- New classes of fast lower bounds for bin packing problems
- New heuristics for one-dimensional bin-packing
