Identifying algorithmic vulnerabilities through simulated annealing

DOI10.1007/s11590-011-0333-zzbMath1259.90165OpenAlexW1992360764MaRDI QIDQ691443

Ramakrishna Thurimella, Dinesh P. Mehta, S. Andrew Johnson

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0333-z

zbMATH Keywords

algorithmsortingsimulated annealingworst-case execution time

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Optimization by Simulated Annealing
• Simulated annealing and genetic algorithms for the facility layout problem: A survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Identifying algorithmic vulnerabilities through simulated annealing