Heuristic evaluation techniques for bin packing approximation algorithms

DOI10.1007/BF02600380MaRDI QIDQ1083199zbMATH OpenFDO

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

Publication date 1985

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02600380

zbMATH Keywords

any fit decreasing algorithmsperformance analysis

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(5)

• Structure preserving reductions among convex optimization problems
• Toward a unified approach for the classification of NP-complete optimization problems
• On an approximation measure founded on the links between optimization and polynomial approximation theory
• scientific article; zbMATH DE number 3644468 (Why is no real title available?)
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083199)