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

Integer Programming and Network Models

Overview of attention for book
Cover of 'Integer Programming and Network Models'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Linear Programming
  3. Altmetric Badge
    Chapter 2 Analysis of Algorithms
  4. Altmetric Badge
    Chapter 3 Graph Theory
  5. Altmetric Badge
    Chapter 4 Dynamic Programming
  6. Altmetric Badge
    Chapter 5 The Integer Programming Problem and its Properties
  7. Altmetric Badge
    Chapter 6 Formulations in Logical Variables
  8. Altmetric Badge
    Chapter 7 Applications and Special Structures
  9. Altmetric Badge
    Chapter 8 Reformulation of Problems
  10. Altmetric Badge
    Chapter 9 Cutting Plane Methods
  11. Altmetric Badge
    Chapter 10 Branch and Bound Methods
  12. Altmetric Badge
    Chapter 11 Heuristic Algorithms
  13. Altmetric Badge
    Chapter 12 Tree Networks
  14. Altmetric Badge
    Chapter 13 Shortest Path Problems
  15. Altmetric Badge
    Chapter 14 Traveling Salesman Problems and Extensions
  16. Altmetric Badge
    Chapter 15 ARC Routing
  17. Altmetric Badge
    Chapter 16 Basic Principles of Network Models
  18. Altmetric Badge
    Chapter 17 Applications of Network Flow Models
  19. Altmetric Badge
    Chapter 18 Network Flow Algorithms
  20. Altmetric Badge
    Chapter 19 Multicommodity Network Flows
  21. Altmetric Badge
    Chapter 20 Networks with Congestion
Attention for Chapter 13: Shortest Path Problems
Altmetric Badge

Citations

dimensions_citation
56 Dimensions

Readers on

mendeley
9 Mendeley
Summary Dimensions citations
So far, Dimensions has found 56 publications that cite this research output.

56

The most recent citing publications are shown below. View all 56 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.