Combinatorial Optimization Theory and Algorithms /

• Κύριοι συγγραφείς: Korte, Bernhard (Συγγραφέας), Vygen, Jens (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Έκδοση: Fourth Edition.
• Σειρά: Algorithms and Combinatorics, 21
• Θέματα: Mathematics.; Operations research.; Decision making.; Computer science > Mathematics.; Mathematical models.; Calculus of variations.; Discrete mathematics.; Combinatorics.; Discrete Mathematics.; Mathematical Modeling and Industrial Mathematics.; Calculus of Variations and Optimal Control; Optimization.; Mathematics of Computing.; Operation Research/Decision Theory.

This comprehensive textbook on combinatorial optimization places 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. It...

Πίνακας περιεχομένων:

• 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.