A compact linear programming formulation of the maximum concurrent flow problem.
Yuanyuan DongEli V. OlinickT. Jason KratzDavid W. MatulaPublished in: Networks (2015)
Keyphrases
- linear programming
- quadratic programming
- semidefinite programming
- linear program
- lp relaxation
- valid inequalities
- linear programming relaxation
- feasible solution
- primal dual
- dynamic programming
- quadratic program
- mathematical programming
- interior point
- np hard
- optimal solution
- mixed integer
- network flow
- integer program
- min cost
- neural network
- column generation
- integer programming
- flow field
- knapsack problem
- database
- optimization procedure
- maximum number
- information flow
- concurrent execution