Applying steepest-edge techniques to a network primal-dual algorithm

Computers and Operations Research

Volumn 24, Issue 7, 1997, Pages 601-609

  Curet, Norman D ^a  

^a UNIVERSITY OF WISCONSIN STEVENS POINT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER NETWORKS; COSTS; DATA STRUCTURES; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

NETWORK PRIMAL DUAL ALGORITHM; RELAXATION METHOD; STEEPEST EDGE TECHNIQUES;

OPERATIONS RESEARCH;

EID: 0031189782     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00086-X     Document Type: Article

References (14)

1. Forrest, J. and Goldfarb, D., Steepest-edge simplex algorithms for linear programming. Mathematical Programming , 1992, 57, 341-374.
2. Curet, N., A primal dual simplex method for linear programs. Operations Research Letters , 1993, 13, 233-237.
3. Schneider, M., A complementary pivoting algorithm for linear network problems. Annals of Operations Research , 1986, 5, 439-462.
4. Barr, R., Glover, F. and Klingman, D., Enhancements of spanning tree labeling procedures for network optimization. INFOR, 1979, 17, 16-34.
5. Kennington, J. and Helgason, R., Algorithms for Network Programming. John Wiley and Sons, New York, 1980.
6. Bertsekas, D. P. and Tseng, P., Relaxation methods for minimum cost ordinary and generalized network flow problems. Operations Research , 1988, 36, 93-114.
7. Curet, N., An incremental primal-dual method for generalized networks. Computers and Operations Research , 1994, 21, 1051-1060.
8. Klingman, D., Napier, A. and Stutz, J., NETGEN: a program for generating large scale capacitated assignment, transportation, and minimum cost network flow problems. Management Science , 1974, 20, 814-821.
9. Ahuja, R., Magnanti, T. and Orlin, J., Network Flows: Theory, Algorithms and Applications. Prentice Hall, New Jersey, 1993.
10. Klingman, D. and Mote, J., Computational Analysis of Large-Scale Pure Networks. ORSA/TIMS Joint National Meeting at New Orleans, 1987.
11. Barr, R. and Hickman, B., Parallel simplex for large pure network problems: computational testing and sources of speedup. Operations Research , 1994, 42, 65-80.
12. Bland, R., Cheriyan, J., Jensen, D. and Ladanyi, L., An empirical study of min cost flow algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1993, 12, 110-156.
13. Goldberg, A. and Kharitonov, M., On implementing scaling push-relabel algorithms for the minimum-cost flow problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1993, 12, 157-198.
14. Resende, M. and Veiga, G., An efficient implementation of a network interior point method. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1993, 12, 299-348.