Quadratic diameter bounds for dual network flow polyhedra.
Steffen BorgwardtElisabeth FinholdRaymond HemmeckePublished in: Math. Program. (2016)
Keyphrases
- network flow
- linear programming
- duality gap
- minimum cost
- integer programming
- min cost
- lower bound
- primal dual
- upper bound
- capacity constraints
- worst case
- optimization model
- set cover
- network flow problem
- traffic control
- objective function
- lower and upper bounds
- pairwise
- bipartite graph
- special case
- integer program
- convex hull
- random walk
- linear functions