Abstract
Computational results are presented comparing the FORTRAN implementation of a primal partitioning algorithm for processing networks with MINOS. A new class of test problems called allocation/processing network problems is introduced.
This paper is supported partly by a grant from the CBA Foundation, the University of Texas at Austin.
This is a preview of subscription content, log in via an institution.
References
M. Engquist and C-H. Chen, “Efficient tree handling procedure for allocation/processing networks”, Research Report CCS 437, Center for Cybernetic Studies, The University of Texas (Austin, TX, 1982).
F. Glover and D. Klingman, “The simplex/SON algorithm for LP/embedded network problems”, Mathematical Programming Study 15 (1981) 148–176.
J. Koene, “Minimal cost flow in processing networks, a primal approach”, Ph.D. Thesis, Eindhoven University of Technology (Eindhoven 1982).
B. Murtagh and M. Saunders, “Large scale linear constrained optimization”, Mathematical Programming 14 (1978) 41–72.
B. Murtagh and M. Saunders, “MINOS users guide”, Technical Report SOL 77-9, System Optimization Laboratory, Department of Operations Research, Stanford University (Stanford, CA, 1977).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Engquist, M., Chen, CH. (1986). Computational comparison of two solution procedures for allocation/processing networks. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121099
Download citation
DOI: https://doi.org/10.1007/BFb0121099
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00922-8
Online ISBN: 978-3-642-00923-5
eBook Packages: Springer Book Archive