Combinatorial optimization : theory and algorithms
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Introduction
-
Altmetric BadgeChapter 2 Graphs
-
Altmetric BadgeChapter 3 Linear Programming
-
Altmetric BadgeChapter 4 Linear Programming Algorithms
-
Altmetric BadgeChapter 5 Integer Programming
-
Altmetric BadgeChapter 6 Spanning Trees and Arborescences
-
Altmetric BadgeChapter 7 Shortest Paths
-
Altmetric BadgeChapter 8 Network Flows
-
Altmetric BadgeChapter 9 Minimum Cost Flows
-
Altmetric BadgeChapter 10 Maximum Matchings
-
Altmetric BadgeChapter 11 Weighted Matching
-
Altmetric BadgeChapter 12 b-Matchings and T-Joins
-
Altmetric BadgeChapter 13 Matroids
-
Altmetric BadgeChapter 14 Generalizations of Matroids
-
Altmetric BadgeChapter 15 NP-Completeness
-
Altmetric BadgeChapter 16 Approximation Algorithms
-
Altmetric BadgeChapter 17 The Knapsack Problem
-
Altmetric BadgeChapter 18 Combinatorial Optimization
-
Altmetric BadgeChapter 19 Multicommodity Flows and Edge-Disjoint Paths
-
Altmetric BadgeChapter 20 Network Design Problems
-
Altmetric BadgeChapter 21 The Traveling Salesman Problem
-
Altmetric BadgeChapter 22 Facility Location