Stack Overflow
Stack Overflow

Questions tagged [max-flow]

The maximum-flow problem, a problem in computer science over a flow network

The maximum flow (max-flow) problem is a problem in computer science, studied in the theory of s, involving finding the maximum flow over a given flow network. It is closely related to the problem for graphs.

214 questions
-1
votes
2 answers

How can I get maximum flow of minimum index?

Denote edge with index i by E[i]. Let S be an array of a solution. If a maximum flow contains E[i], S[i] = 1. Otherwise, S[i] = 0. I want to get a maximum flow whose solution is alphabetically minimum. I can get maximum flow with Ford-Fulkerson, but…
Snow Innocent
  • 137
  • 8
-1
votes
2 answers

Minimum cost maximum flow algorithm with custom cost function

What kind of cost functions can be used in minimum cost maximum flow algorithm? Is it possible to have a cost function similar to: if flow on an edge is between [1, X], cost = FixedCost + C1 + flow * cost_per_flow[C1] if flow on an edge is between…
Alex D.
  • 1
  • 2
-2
votes
1 answer

How do I solve this using max flow?

C1 cities are willing to sell some goods and the other C2 cities are willing to buy some goods (each city can either sell or buy goods, but not both). Each selling city will sell its goods to one city only, and each buying city will buy goods from…
Simo
  • 2,292
  • 5
  • 30
  • 45
1 2 3
…
14
15