# Tag Info

### Minimum cost flow problem with multiple arcs between nodes in Python / Google OR

I'm assuming that parallel arcs between the same nodes differ in something relevant (cost?), since otherwise you could just combine them into a single arc (summing capacities, if they are capacitated)....
• 39.9k

### Maximum Flow Linear Programming

In the graph, we didn't have the direct connection between source and sink. However, we can reach sink from source by pass intermediate nodes. Therefore, we maximum all of arc's flow. Or you can just ...
• 411

### Partial Lagrangian in the Max-Flow problem

Unfortunately, there is NO guarantee to find the primal feasible solution in the context of Lagrangian relaxation, especially when it comes to solving integer programming. In order to get a feasible ...
• 9,123
Accepted

### Partial Lagrangian in the Max-Flow problem

The error comes in assuming that, given a zero duality gap, the solution to the relaxed LP (which I agree becomes a shortest path problem) would be the optimal flow solution. Let $X$ the set of all ...
• 39.9k
Accepted

### How to use max flow to schedule machines? (building a network)

When you have to model a problem as a flow problem, you can often interpret it as an 'assignment' or 'selection' problem. Here, your scheduling problem is equivalent to assigning jobs to machines. In ...
• 3,481
1 vote

### Dichotomic search for biobjective linear program, max flow problem for hospital patients

The first thing that comes to mind, is, to try to model the process in something like (timed?) colored Petri nets. Then, perhaps do some process mining and network partitioning and shortest path tree ...
• 1,502

Only top scored, non community-wiki answers of a minimum length are eligible