↓ Skip to main content
What is this page? Embed badge

Combinatorial optimization : theory and algorithms

Overview of attention for book
Cover of 'Combinatorial optimization : theory and algorithms'

Table of Contents

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

Citations

dimensions_citation
68 Dimensions
Summary Dimensions citations
So far, Dimensions has found 68 publications that cite this research output.

68

The most recent citing publications are shown below. View all 68 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.