Integer Programming and Combinatorial Optimization 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings /

This book constitutes the proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011, held in New York, USA in June 2011. The 33 papers presented were carefully reviewed and selected from 110 submissions. The conference is a forum for researcher...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Günlük, Oktay (Editor ), Woeginger, Gerhard J. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Edición:1st ed. 2011.
Colección:Theoretical Computer Science and General Issues, 6655
Temas:
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Computer graphics.
Artificial intelligence-Data processing.
Numerical analysis.
Computer networks .
Discrete Mathematics in Computer Science.
Computer Graphics.
Data Science.
Numerical Analysis.
Computer Communication Networks.
Acceso en línea:Texto Completo
Descripción
Sumario:This book constitutes the proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011, held in New York, USA in June 2011. The 33 papers presented were carefully reviewed and selected from 110 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
Descripción Física:XIII, 432 p. 30 illus., 3 illus. in color. online resource.
ISBN:9783642208072
ISSN:2512-2029 ;

Ejemplares similares