- Metaheuristics: Intelligent Problem Solving
Marco Caserta and Stefan Voß
- Just MIP it!
Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin
- MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
Jakob Puchinger, Günther R. Raidl, and Sandro Pirkwieser
- Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms
Irina Dumitrescu and Thomas Stützle
- Decomposition Techniques as Metaheuristic Frameworks
Marco Boschetti, Vittorio Maniezzo, and Matteo Roffilli
- Convergence Analysis of Metaheuristics
Walter J. Gutjahr
- MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines
Alexandre Dolgui, Anton Eremeev, and Olga Guschinskaya
- (Meta-)Heuristic Separation of Jump Cuts in a Branch & Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
Martin Gruber and Günther R. Raidl
- A Good Recipe for Solving MINLPs
Leo Liberti, Giacomo Nannicini, and Nenad Mladenovic
- Variable Intensity Local Search
Snežana Mitrovic-Minic and Abraham P. Punnen
- A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem
Sandra Ulrich Ngueveu, Christian Prins, and Roberto Wolfer Calvo
Author(s): Marco Caserta, Stefan Voß (auth.), Vittorio Maniezzo, Thomas Stützle, Stefan Voß (eds.)
Series: Annals of Information Systems 10
Edition: 1
Publisher: Springer US
Year: 2010
Language: English
Pages: 270
Tags: Operations Research/Decision Theory; Business Information Systems; Game Theory/Mathematical Methods; Operations Research, Mathematical Programming
Front Matter....Pages i-xv
Metaheuristics: Intelligent Problem Solving....Pages 1-38
Just MIP it!....Pages 39-70
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics....Pages 71-102
Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms....Pages 103-134
Decomposition Techniques as Metaheuristic Frameworks....Pages 135-158
Convergence Analysis of Metaheuristics....Pages 159-187
MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines....Pages 189-208
(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem....Pages 209-229
A Good Recipe for Solving MINLPs....Pages 231-244
Variable Intensity Local Search....Pages 245-252
A Hybrid Tabu Search for the m -Peripatetic Vehicle Routing Problem....Pages 253-266
Back Matter....Pages 1-3