Use of representative operation counts in computational testing of algorithms

INFORMS Journal on Computing

Volumn 8, Issue 3, 1996, Pages 318-330

  Ahuja, Ravindra K ^a   Orlin, James B ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004931591     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.8.3.318     Document Type: Article

References (6)

1. R.K. AHUJA, T.L. MAGNANTI and J.B. ORLIN, 1993. Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Inc., Englewood Cliffs, NJ.
2. J.L. BENTLEY, 1990. Experiments on Geometric Traveling Salesman Heuristics, Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 91-99.
3. th Ed., Vol. II, Saunders College Publishing, 451-475.
4. R.G. BLAND and D.L. JENSEN, 1992. On the Computational Behavior of a Polynomial-Time Network Flow Algorithm, Mathematical Programming 54, 1-39.
5. G. BRADLEY, G. BROWN and G. GRAVES, 1977. Design and Implementation of Large Scale Primal Transshipment Algorithms, Management Science 21, 1-38.
6. M.H. BROWN, 1988. Algorithm Animation, MIT Press, Cambridge, MA.