Edge-directions of standard polyhedra with applications to network flows

DOI10.1007/s10898-004-4313-zzbMath1080.90013OpenAlexW2076263225MaRDI QIDQ811875

Uriel G. Rothblum, Shmuel Onn, Yoav Tangir

Publication date: 23 January 2006

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

Full work available at URL: https://doi.org/10.1007/s10898-004-4313-z

zbMATH Keywords

polyhedranetwork flowsEdge-directions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (6)

Efficient edge-skeleton computation for polytopes defined by oracles ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ The use of edge-directions and linear programming to enumerate vertices ⋮ The partition bargaining problem ⋮ Optimality conditions for maximizing a function over a polyhedron ⋮ A note on the approximability of deepest-descent circuit steps

Cites Work

• Unnamed Item
• Unnamed Item
• Canonical bases in linear programming
• Convex combinatorial optimization
• The partition bargaining problem
• On the equivalence between some discrete and continuous optimization problems
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
• Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions

This page was built for publication: Edge-directions of standard polyhedra with applications to network flows