INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION (PB 2008)

LODI A.

ISBN 10: 3540688862 / ISBN 13: 9783540688860

Edité par SP SPRINGER, 2008

Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-12 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability. N° de réf. du vendeur CBS 9783540688860

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.

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.

Détails bibliographiques

Titre : INTEGER PROGRAMMING AND COMBINATORIAL ...
Éditeur : SP SPRINGER
Date d'édition : 2008
Reliure : Couverture souple
Etat : New
Edition : Edition internationale