Integer Programming and Combinatorial Optimization [electronic resource] : 9th International IPCO Conference Cambridge, MA, USA, May 27–29, 2002 Proceedings /

This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.

Saved in:
Bibliographic Details
Main Authors: Cook, William J. editor., Schulz, Andreas S. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002
Subjects:Computer science., Software engineering., Computers., Algorithms., Numerical analysis., Computer science, Probabilities., Computer Science., Theory of Computation., Probability Theory and Stochastic Processes., Software Engineering/Programming and Operating Systems., Discrete Mathematics in Computer Science., Numeric Computing., Algorithm Analysis and Problem Complexity.,
Online Access:http://dx.doi.org/10.1007/3-540-47867-1
Tags: Add Tag
No Tags, Be the first to tag this record!