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
Table of contents (32 papers)
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
About this book
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