Edge-directions of standard polyhedra with applications to network flows

Journal of Global Optimization

Volumn 33, Issue 1, 2005, Pages 109-122

  Onn, Shmuel ^a   Rothblum, Uriel G ^a   Tangir, Yoav ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Edge directions; Network flows; Polyhedra

Indexed keywords

CHARACTERIZATION; COMBINATORIAL CIRCUITS; EDGE DETECTION; GRAPH THEORY; STANDARDS;

EDGE-DETECTION; NETWORK FLOWS; POLYHEDRA;

GLOBAL OPTIMIZATION;

EID: 27744581806     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-004-4313-z     Document Type: Article

References (11)

1. Ben-Israel, A. (1988), Canonical bases in linear programming, Linear Algebra and Its Applications, 102, 95-119.
2. Dantzig, G. (1951), Maximization of a linear function of variables subject to linear inequalities. In: Koopman, T.C. (ed.), Activity Analysis of Production and Allocation, Chapter XXI, Cowles Commission Monograph 13, Wiley, New York.
3. Gritzmann, P. and Sturmfels, B. (1993), Minkowski addition of polytopes: computational complexity and applications to Gröbner bases, SIAM Journal on Discrete Mathematics 6, 246-269.
4. Hwang, F.K. and Rothblum, U.G. (1996), Directional-quasi-convexity, asymmetric Schur convexity and optimality of consecutive partitions, Mathematics of Operations Research, 21, 540-554.
5. Onn, S. and Rothblum, U.G. (2004), Convex combinatorial optimization, Discrete and Computational Geometry, 32, 549-566.
6. Rockafellar, T. (1970), Convex Analysis, Princeton University Press, Princeton, NJ.
7. Rockafellar, T. (1984), Network Flows and Monotropic Optimization, Wiley Interscience.
8. Rothblum, U.G. and Tangir, Y. (2004), The Partition Bargaining Problem, Discrete Applied Math., to appear.
9. Schrijver, A. (1986), Theory of Linear and Integer Programming, John Wiley and Sons, New York.
10. Schultz, A.S., Weisamntel, R. and Ziegler, G. (1995), (0-1)-integer programming: Optimization and augmentation are equivalent. In: Proceedings of the Third Annual European Symposium on Algorithms, Lecture Notes in Computer Science 979, Springer, Berlin, Germany, pp. 473-483.
11. Tardella, Fabio (1990), On the equivalence between some discrete and continuous optimization problems, Annals of Operations Research, 2, 291-300.