Heuristic evaluation techniques for bin packing approximation algorithms

DOI10.1007/BF02600380zbMath0604.68047MaRDI QIDQ1083199

E. Burattini, A. Aiello, A. Massarotti, Francesco Ventriglia

Publication date: 1985

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

performance analysisany fit decreasing algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (5)

On an approximation measure founded on the links between optimization and polynomial approximation theory ⋮ Unnamed Item ⋮ Structure preserving reductions among convex optimization problems ⋮ Toward a unified approach for the classification of NP-complete optimization problems ⋮ Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)

Cites Work

• ``A posteriori evaluation of bin packing approximation algorithms
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• The complexity of theorem-proving procedures

This page was built for publication: Heuristic evaluation techniques for bin packing approximation algorithms