Ebook: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming
- Tags: Operations Research/Decision Theory, Business Information Systems, Game Theory/Mathematical Methods, Operations Research Mathematical Programming
- Series: Annals of Information Systems 10
- Year: 2010
- Publisher: Springer US
- Edition: 1
- Language: English
- pdf
- Metaheuristics: Intelligent Problem Solving
- Just MIP it!
- MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
- Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms
- Decomposition Techniques as Metaheuristic Frameworks
- Convergence Analysis of Metaheuristics
- MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines
- (Meta-)Heuristic Separation of Jump Cuts in a Branch & Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
- A Good Recipe for Solving MINLPs
- Variable Intensity Local Search
- A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem
Sandra Ulrich Ngueveu, Christian Prins, and Roberto Wolfer Calvo
Marco Caserta and Stefan Voß
Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin
Jakob Puchinger, Günther R. Raidl, and Sandro Pirkwieser
Irina Dumitrescu and Thomas Stützle
Marco Boschetti, Vittorio Maniezzo, and Matteo Roffilli
Walter J. Gutjahr
Alexandre Dolgui, Anton Eremeev, and Olga Guschinskaya
Martin Gruber and Günther R. Raidl
Leo Liberti, Giacomo Nannicini, and Nenad Mladenovic
Snežana Mitrovic-Minic and Abraham P. Punnen
- Metaheuristics: Intelligent Problem Solving
- Just MIP it!
- MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
- Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms
- Decomposition Techniques as Metaheuristic Frameworks
- Convergence Analysis of Metaheuristics
- MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines
- (Meta-)Heuristic Separation of Jump Cuts in a Branch & Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
- A Good Recipe for Solving MINLPs
- Variable Intensity Local Search
- A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem
Sandra Ulrich Ngueveu, Christian Prins, and Roberto Wolfer Calvo
Marco Caserta and Stefan Vo?
Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin
Jakob Puchinger, G?nther R. Raidl, and Sandro Pirkwieser
Irina Dumitrescu and Thomas St?tzle
Marco Boschetti, Vittorio Maniezzo, and Matteo Roffilli
Walter J. Gutjahr
Alexandre Dolgui, Anton Eremeev, and Olga Guschinskaya
Martin Gruber and G?nther R. Raidl
Leo Liberti, Giacomo Nannicini, and Nenad Mladenovic
Sne?ana Mitrovic-Minic and Abraham P. Punnen
- Metaheuristics: Intelligent Problem Solving
- Just MIP it!
- MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
- Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms
- Decomposition Techniques as Metaheuristic Frameworks
- Convergence Analysis of Metaheuristics
- MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines
- (Meta-)Heuristic Separation of Jump Cuts in a Branch & Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
- A Good Recipe for Solving MINLPs
- Variable Intensity Local Search
- A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem
Sandra Ulrich Ngueveu, Christian Prins, and Roberto Wolfer Calvo
Marco Caserta and Stefan Vo?
Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin
Jakob Puchinger, G?nther R. Raidl, and Sandro Pirkwieser
Irina Dumitrescu and Thomas St?tzle
Marco Boschetti, Vittorio Maniezzo, and Matteo Roffilli
Walter J. Gutjahr
Alexandre Dolgui, Anton Eremeev, and Olga Guschinskaya
Martin Gruber and G?nther R. Raidl
Leo Liberti, Giacomo Nannicini, and Nenad Mladenovic
Sne?ana Mitrovic-Minic and Abraham P. Punnen
Content:
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
- Metaheuristics: Intelligent Problem Solving
- Just MIP it!
- MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
- Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms
- Decomposition Techniques as Metaheuristic Frameworks
- Convergence Analysis of Metaheuristics
- MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines
- (Meta-)Heuristic Separation of Jump Cuts in a Branch & Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
- A Good Recipe for Solving MINLPs
- Variable Intensity Local Search
- A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem
Sandra Ulrich Ngueveu, Christian Prins, and Roberto Wolfer Calvo
Marco Caserta and Stefan Vo?
Matteo Fischetti, Andrea Lodi, and Domenico Salvagnin
Jakob Puchinger, G?nther R. Raidl, and Sandro Pirkwieser
Irina Dumitrescu and Thomas St?tzle
Marco Boschetti, Vittorio Maniezzo, and Matteo Roffilli
Walter J. Gutjahr
Alexandre Dolgui, Anton Eremeev, and Olga Guschinskaya
Martin Gruber and G?nther R. Raidl
Leo Liberti, Giacomo Nannicini, and Nenad Mladenovic
Sne?ana Mitrovic-Minic and Abraham P. Punnen
Content:
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
....