Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2241)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (7 chapters)
-
Front Matter
-
Back Matter
About this book
Keywords
- Branch and Cut Algorithms
- Combinatorial Optimization
- Computational Combinatorial Optimization
- Discrete Computations
- Discrete Structures
- Optimization Algorithms
- Polyhedral Combinatorics
- Traveling Salesman Problem (TSP)
- algorithms
- modeling
- optimization
- programming
- algorithm analysis and problem complexity
- data structures
- combinatorics
Editors and Affiliations
-
Universität zu Köln,Institut für Informatik, Köln, Germany
Michael Jünger
-
ENSIMAG - antenne de Montbonnot Laboratoire Informatique et Distribution, ZIRST, Montbonnot Saint Martin, France
Denis Naddef
Bibliographic Information
Book Title: Computational Combinatorial Optimization
Book Subtitle: Optimal or Provably Near-Optimal Solutions
Editors: Michael Jünger, Denis Naddef
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45586-8
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2001
Softcover ISBN: 978-3-540-42877-0Published: 21 November 2001
eBook ISBN: 978-3-540-45586-8Published: 01 January 2001
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 310
Topics: Optimization, Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity, IT in Business, Data Structures, Combinatorics