Michel Gendreau, J. Potvin, Q. Montreal, Q. Montreal, Potvin, Darrell Whitley, Pablo Moscato, Carlos Cotta, M. Dorigo, Thomas Stützle, Xiaodong Li, Maurice Clerc, G. Raidl, Jakob Puchinger, Christian Blum, T. Crainic, Edmund K. Burke, Matthew R. Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, John R. Woodward, R. Battiti, M. Brunato, Andrea Mariello, W. Gutjahr, Roberto Montemanni, Manuel López-Ibáñez, J. Silberholz, Bruce L. Golden, Swati Gupta, Xingyin Wang, R. Aceves, A. Duarte, R. H. Smith, Pierre Hansen, H. R. Lourenço, Rafael Martí, Olivier C. Martin, M. Mongeau, J. M. Moreno-Vega, J. A. M. Pérez, D. Pisinger, Celso C. Ribeiro, Stefan Ropke, Daniel Delahaye, S. Chaimatanan
2019International Series in Operations Research and Management Science
tlooto Summary
This chapter presents the straightforward application of SA to two classical and simple classical NP-hard combinatorial optimization problems: the knapsack problem and the NP-hard combinatorial optimization problems.
Abstract
Abstract is not available.
Citation format
GENDREAU, Michel, et al. Handbook of metaheuristics. International Series in Operations Research and Management Science, 2019.