The diameters of network-flow polytopes satisfy the Hirsch conjecture

Authors

Keywords

Combinatorial diameter, Diameter of graphs of polyhedra, Hirsch conjecture, Simplex method, Network simplex method, Network-flow polytopes, Transportation polytopes, 52B05, 90C05, 90C08

Journal

MATHEMATICAL PROGRAMMING

Volume -, Issue -, Pages -

Publisher

Springer Nature

Online

2017-07-11

DOI

10.1007/s10107-017-1176-x

References

View 6 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started