Computing monotone disjoint paths on polytopes

DOI10.1007/s10878-008-9151-3zbMath1163.90642OpenAlexW2034408278MaRDI QIDQ1016050

David Avis, Bohdan Kaluzny

Publication date: 4 May 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9151-3

zbMATH Keywords

linear programmingpolytopesdegeneracysimplex methodnetwork flowdisjoint pathsvertex enumerationreverse searchHolt-Klee

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reverse search algorithm for the neighborhood problem
• Pivot rules for linear programming: A survey on recent theoretical developments
• How good are convex hull algorithms?
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Reverse search for enumeration
• Maximal Flow Through a Network
• The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
• Lectures on Polytopes
• On the Monotone Upper Bound Problem
• The maximum numbers of faces of a convex polytope

This page was built for publication: Computing monotone disjoint paths on polytopes