Network Models and Optimization: Multiobjective Genetic Algorithm Approach - Lin Lin,Mitsuo Gen,Runwei Cheng
-25% su kodu BOOKS
Pristatymas per 22-28 d.d.
30 dienų grąžinimo politika
Network models are critical tools in business, management, science and industry. Network Models and Optimization: Multiobjective Genetic Algorithm Approach presents an insightful, comprehensive, and up-to-date treatment of multiple objective genetic algorithms to network optimization problems in many disciplines, such as engineering, computer science, operations research, transportation, telecommunication, ... Visas aprašymas
Jums taip pat gali patikti
Aprašymas
Network models are critical tools in business, management, science and industry. Network Models and Optimization: Multiobjective Genetic Algorithm Approach presents an insightful, comprehensive, and up-to-date treatment of multiple objective genetic algorithms to network optimization problems in many disciplines, such as engineering, computer science, operations research, transportation, telecommunication, and manufacturing.
Network Models and Optimization: Multiobjective Genetic Algorithm Approach extensively covers algorithms and applications, including shortest path problems, minimum cost flow problems, maximum flow problems, minimum spanning tree problems, travelling salesman and postman problems, location-allocation problems, project scheduling problems, multistage-based scheduling problems, logistics network problems, communication network problem, and network models in assembly line balancing problems, and airline fleet assignment problems.
Network Models and Optimization: Multiobjective Genetic Algorithm Approach can be used both as a student textbook and as a professional reference for practitioners in many disciplines who use network optimization methods to model and solve problems.
Daugiau informacijos
| Autorius | Lin Lin, Mitsuo Gen, Runwei Cheng |
|---|---|
| Leidėjas | Springer London |
| Išleidimo metai | 2008 |
| Viršelio tipas | Kieti viršeliai |
| EAN | 9781848001800 |