Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings - Couverture souple

 
9783540688860: Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings
Couverture souple
ISBN 10 : 3540688862 ISBN 13 : 9783540688860
Editeur : Springer, 2008

Synopsis

This book constitutes the refereed proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008, held in Bertinoro, Italy, in May 2008. The 32 revised full papers presented were carefully reviewed and selected from 95 submissions. The papers cover various aspects of integer programming and combinatorial optimization and present recent developments in theory, computation, and applications in that area. Topics included are such as approximation algorithms, branch and bound algorithms, branch and cut algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms and competitive analysis, polyhedral combinatorics, randomized algorithms, random graphs, scheduling theory and scheduling algorithms, and semidefinite programs.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

This book constitutes the refereed proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008, held in Bertinoro, Italy, in May 2008. The 32 revised full papers presented were carefully reviewed and selected from 95 submissions. The papers cover various aspects of integer programming and combinatorial optimization and present recent developments in theory, computation, and applications in that area. Topics included are such as approximation algorithms, branch and bound algorithms, branch and cut algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms and competitive analysis, polyhedral combinatorics, randomized algorithms, random graphs, scheduling theory and scheduling algorithms, and semidefinite programs.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Springer
Date d'édition
2008
Langue
anglais
ISBN 10 
3540688862
ISBN 13 
9783540688860
Reliure
Broché
Nombre de pages
496
Éditeur
Lodi Andrea
Coordonnées du fabricant
non disponible
Personne responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne