The diameters of network-flow polytopes satisfy the Hirsch conjecture.

Steffen Borgwardt Jesús A. De Loera Elisabeth Finhold

Published in: Math. Program. (2018)

Keyphrases

network flow
minimum cost
optimization model
linear programming
min cost
traffic control
capacity constraints
network flow problem
integer programming
set cover
convex hull
search algorithm
lattice points
lower bound
np hard
valid inequalities