Combinatorial Optimization Theory and Algorithms /

Mostrar otras versiones (2)

This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Sinc...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Korte, Bernhard (Autor), Vygen, Jens (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:3rd ed. 2006.
Colección:Algorithms and Combinatorics,
Temas:
Discrete mathematics.
Mathematical optimization.
Calculus of variations.
Computer science-Mathematics.
Discrete Mathematics.
Calculus of Variations and Optimization.
Mathematics of Computing.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Graphs
  • Linear Programming
  • Linear Programming Algorithms
  • Integer Programming
  • Spanning Trees and Arborescences
  • Shortest Paths
  • Network Flows
  • Minimum Cost Flows
  • Maximum Matchings
  • Weighted Matching
  • b-Matchings and T-Joins
  • Matroids
  • Generalizations of Matroids
  • NP-Completeness
  • Approximation Algorithms
  • The Knapsack Problem
  • Bin-Packing
  • Multicommodity Flows and Edge-Disjoint Paths
  • Network Design Problems
  • The Traveling Salesman Problem
  • Facility Location.

Ejemplares similares