Design of Heuristic Algorithms for Hard Optimization
Av Eric D. Taillard, 2022.Del av serien Graduate Texts in Operations Research.
With Python Codes for the Travelling Salesman Problem
Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling.- 1. Elements of Graphs and Complexity Theory.- 2. A Short List of Combinatorial Optimization Problems.- 3. Problem Modelling.- Part II: Basic Heuristic Techniques.- 4. Constructive Methods.- 5. Local Search.- 6. Decomposition Methods.- Part III: Popular Metaheuristics.- 7. Randomized Methods.- 8. Construction Learning.- 9. Local Search Learning.- 10. Population Management.- 11. Heuristics Design.- 12. Codes.
Språk: Engelsk
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 17 dager
Design of Heuristic Algorithms for Hard Optimization
Av Eric D. Taillard, 2022.Del av serien Graduate Texts in Operations Research.
With Python Codes for the Travelling Salesman Problem
Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling.- 1. Elements of Graphs and Complexity Theory.- 2. A Short List of Combinatorial Optimization Problems.- 3. Problem Modelling.- Part II: Basic Heuristic Techniques.- 4. Constructive Methods.- 5. Local Search.- 6. Decomposition Methods.- Part III: Popular Metaheuristics.- 7. Randomized Methods.- 8. Construction Learning.- 9. Local Search Learning.- 10. Population Management.- 11. Heuristics Design.- 12. Codes.
Språk: Engelsk
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 17 dager
Ved å fullføre kjøpet aksepterer du kjøpsvilkårene.
