Pivot Strategies for Primal-Simplex Network Codes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Pivot Strategies for Primal-Simplex Network Codes

Full text

Pdf (308 KB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 2 (April 1978) table of contents

Pages: 266 - 270

Year of Publication: 1978

ISSN:0004-5411

Author

John M. Mulvey

Graduate School of Business Administration, Harvard University, Boston, MA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 25, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322063.322070 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BRADLEY, G H Survey of determmlstlc networks. AIIE Trans 7, 3 (1975), 222-234
	2	BRADLEY, G.H., BROWN, G.G, AND GRAVES, G.W. Design and implementation of large scale pnmal transshipment algorithms Manage. $c~ 24, 1 (Sept 1977), 1-34
	3	DEMBO, R, AND MULVEY, J.M On the analys~s and companson of mathematical programming algonthms and software Proc. Bicentenmal Conf on Math. Programming, NBS, Galthersburg, Md, 1978.
	4	GLOVER, F, KARNEY, D, AND KLINGMAN, D Augmented predecessor index method for locating stepping stone paths and asslgmng dual prices in dtstnbuUon problems Transport Sc~ 6, 1 (1972) 171-181
	5	GLOVER, F, KARNEY, D., KLINGMAN, D, AND NAPIER, A A computational study on start procedures, basis change cntcria, and solution algonthms for transportation problems Manage. Scl 20, 5 (1974), 793-813
	6	GLOVER, F., AND KLINGMAN, D Network apphcation m industry and government Res Rep CS 247, U of Texas at Austin, Austm, Tex, 1975
	7	Britton Harris, A Code for the Transportation Problem of Linear Programming, Journal of the ACM (JACM), v.23 n.1, p.155-157, Jan. 1976 [doi>10.1145/321921.321937]
	8	KLINGMAN, D, NAPIER, A, AND ROSS, G. A computational study on the effects of problem dimensions on solution time for transportation problems Res. Rep CS 135, U. of Texas at Austin, Austin, Tex, 1973
	9	KLINGMAN, D, NAPIER, A, AND STUTZ, J. NETGEN A program for generating large-scale assignment, transportation, and minimum cost flow network problems. Manage Sct 20, 5 (1974), 814-82 I
	10	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	11	MtJLVEY, J.M Testing of a large-scale network optimization program Res Rep HBS 75-38, Harvard U, Boston, Mass, 1975 To appear
	12	V. Srinivasan , G. L. Thompson, Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems, Journal of the ACM (JACM), v.19 n.4, p.712-726, Oct. 1972 [doi>10.1145/321724.321734]
	13	V. Srinivasan , G. L. Thompson, Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm, Journal of the ACM (JACM), v.20 n.2, p.194-213, April 1973 [doi>10.1145/321752.321754]

CITED BY 5

	Michael D. Chang , Chou-Hong J. Chen , Michael Engquist, An improved primal simplex variant for pure processing networks, ACM Transactions on Mathematical Software (TOMS), v.15 n.1, p.64-78, March 1989
	David Eppstein, Clustering for faster network simplex pivots, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.160-166, January 23-25, 1994, Arlington, Virginia, United States
	K. G. Ramakrishnan, Solving Two-Commodity Transportation Problems with Coupling Constraints, Journal of the ACM (JACM), v.27 n.4, p.736-757, Oct. 1980
	Betty L. Hickman , Dan Scott, A Subtree-Partitioning Algorithm for Inducing Parallelism in Network Simplex Dual Updates, Computational Optimization and Applications, v.7 n.2, p.183-197, March 1997
	Minghe Sun, Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming, INFORMS Journal on Computing, v.17 n.4, p.422-437, October 2005

INDEX TERMS

Primary Classification:
E. Data

Additional Classification:
G. Mathematics of Computing
G.2 DISCRETE MATHEMATICS
G.2.2 Graph Theory
Subjects: Network problems

General Terms:
Design, Measurement, Performance, Theory

Collaborative Colleagues:

John M. Mulvey: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player