Bin-packing by simulated annealing

DOI10.1016/0898-1221(94)90077-9zbMath0808.90110OpenAlexW1994874668MaRDI QIDQ1324346

R. L. Rao, S. Sitharama Iyengar

Publication date: 15 March 1995

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(94)90077-9

zbMATH Keywords

combinatorial optimizationMonte Carlo methodsglobal minimumNP completenessbin-packingsimulated anealingstatistical cooling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (4)

Exact and approximate methods for a one-dimensional minimax bin-packing problem ⋮ Metaheuristics: A bibliography ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Augmented neural networks and problem structure-based heuristics for the bin-packing problem

Cites Work

• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Equation of State Calculations by Fast Computing Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bin-packing by simulated annealing