Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2081)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
This volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi- torial optimization. The aim is to present recent developments in theory, com- tation, and application of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu- tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nit e programs. IPCO was established in 1988 when the rs t IPCO program committee was formed. The locations and years of the seven rs t IPCO conferences were: IPCO I, Waterloo (Canada) 1990, IPCO II, Pittsburgh (USA) 1992, IPCO III, - ice (Italy) 1993, IPCO IV, Copenhagen (Denmark) 1995, IPCO V, Vancouver (Canada) 1996, IPCO VI, Houston (USA) 1998, IPCO VII, Graz (Austria) 1999. IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place. Since the MPS meeting is triennial, IPCO conferences are held twice in every three-year period. Asa rule, IPCO is held somewhere in Northern America in even years, and somewhere in Europe in odd years.
Similar content being viewed by others
Keywords
- Approximation
- Approximation Algorithms
- Computational Complexity
- Discrete Mathematics
- Graph Algorithms
- Integer Programming
- Mathematical Programming
- Network Algorithms
- Scheduling Computational Geometry
- Variable
- algorithms
- combinatorial optimization
- complexity
- optimization
- programming
- algorithm analysis and problem complexity
- combinatorics
Table of contents (32 papers)
-
Front Matter
Editors and Affiliations
Bibliographic Information
Book Title: Integer Programming and Combinatorial Optimization
Book Subtitle: 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings
Editors: Karen Aardal, Bert Gerards
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45535-3
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2001
Softcover ISBN: 978-3-540-42225-9Published: 30 May 2001
eBook ISBN: 978-3-540-45535-6Published: 29 June 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 428
Topics: Probability Theory and Stochastic Processes, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, IT in Business, Combinatorics