| Titre : | Progress in Combinatorial Optimization | | Type de document : | texte imprimé | | Editeur : | A.Ridha Mahjoub | | Année de publication : | 2012 | | ISBN/ISSN/EAN : | 978-1-84821-206-0 | | Langues : | Anglais (eng) | | Tags : | computational complexity approximation algorithms cutting-plane | | Index. décimale : | I1 I1 - Informatique Théorique | | Résumé : | This book aims to present recent developments and new trends in Combinatorial Optimization. The topics will include, among others, complexity analysis, exact and heuristic methods, cutting-plane techniques, approximations algorithms, computational complexity and network design algorithms.
Combinatorial Optimization is an active research area that has applications in many domains such as communications, network design, VLSI, scheduling, production and computational biology. In recent years, new results and major advances have been seen in many areas including computational complexity, approximation algorithms, cutting-plane-based methods and submodularity function minimization. More efficient and powerful methods have been developed for approaching real-world problems, and new concepts and theoretical results have been introduced. This book presents a collection of chapters surveying some of these advances. |
Progress in Combinatorial Optimization [texte imprimé] . - [S.l.] : A.Ridha Mahjoub, 2012. ISBN : 978-1-84821-206-0 Langues : Anglais ( eng) | Tags : | computational complexity approximation algorithms cutting-plane | | Index. décimale : | I1 I1 - Informatique Théorique | | Résumé : | This book aims to present recent developments and new trends in Combinatorial Optimization. The topics will include, among others, complexity analysis, exact and heuristic methods, cutting-plane techniques, approximations algorithms, computational complexity and network design algorithms.
Combinatorial Optimization is an active research area that has applications in many domains such as communications, network design, VLSI, scheduling, production and computational biology. In recent years, new results and major advances have been seen in many areas including computational complexity, approximation algorithms, cutting-plane-based methods and submodularity function minimization. More efficient and powerful methods have been developed for approaching real-world problems, and new concepts and theoretical results have been introduced. This book presents a collection of chapters surveying some of these advances. |
|
Affiner la recherche Interroger des sources externesProgress in Combinatorial Optimization
