Flow Network Capacity Augmentation

  • Thread starter mXSCNT
  • Start date
  • #1
315
1
Suppose that you have a http://en.wikipedia.org/wiki/Flow_network" [Broken] with integer edge capacities, and n dollars. You may spend one dollar to increase the capacity of an existing edge by one. The question is, how can you spend your dollars so that the maximum flow through the resulting network is maximized?
 
Last edited by a moderator:

Answers and Replies

  • #2
530
7
Suppose that you have a http://en.wikipedia.org/wiki/Flow_network" [Broken] with integer edge capacities, and n dollars. You may spend one dollar to increase the capacity of an existing edge by one. The question is, how can you spend your dollars so that the maximum flow through the resulting network is maximized?

The max-flow min-cut theorem might be a good place to start in constructing a spending strategy.
 
Last edited by a moderator:

Related Threads on Flow Network Capacity Augmentation

  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
3
Views
497
  • Last Post
Replies
4
Views
1K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
3
Views
5K
Q
  • Last Post
Replies
7
Views
936
  • Last Post
Replies
9
Views
5K
  • Last Post
Replies
1
Views
1K
Top