AHA-BUCH

Matheuristics
-12 %

Matheuristics

Hybridizing Metaheuristics and Mathematical Programming
 Taschenbuch
Sofort lieferbar | Lieferzeit:3-5 Tage I

Unser bisheriger Preis:ORGPRICE: 160,49 €

Jetzt 141,23 €*

Alle Preise inkl. MwSt. | zzgl. Versand
ISBN-13:
9781441913050
Einband:
Taschenbuch
Erscheinungsdatum:
01.10.2009
Seiten:
269
Autor:
Vittorio Maniezzo
Gewicht:
421 g
Format:
235x159x23 mm
Serie:
10, Annals of Information Systems
Sprache:
Englisch
Beschreibung:

Presents the latest research on using mathematical programming in metaheuristics frameworks
From the contents:

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 Metaheuristics 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.- Index.
Metaheuristics: Intelligent Problem SolvingMarco 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