9783540688860-3540688862-Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings (Lecture Notes in Computer Science, 5035)

Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings (Lecture Notes in Computer Science, 5035)

ISBN-13: 9783540688860
ISBN-10: 3540688862
Edition: 2008
Author: Alessandro Panconesi, Andrea Lodi, Giovanni Rinaldi
Publication date: 2008
Publisher: Springer
Format: Paperback 488 pages
FREE US shipping

Book details

ISBN-13: 9783540688860
ISBN-10: 3540688862
Edition: 2008
Author: Alessandro Panconesi, Andrea Lodi, Giovanni Rinaldi
Publication date: 2008
Publisher: Springer
Format: Paperback 488 pages

Summary

Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings (Lecture Notes in Computer Science, 5035) (ISBN-13: 9783540688860 and ISBN-10: 3540688862), written by authors Alessandro Panconesi, Andrea Lodi, Giovanni Rinaldi, was published by Springer in 2008. With an overall rating of 3.8 stars, it's a notable title among other books. You can easily purchase or rent Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings (Lecture Notes in Computer Science, 5035) (Paperback) from BooksRun, along with many other new and used books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.48.

Description

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.
Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book