Abstract
The increased importance of designing and implementing algorithms to solve particular management problems has created the need for more robust test problem generators that can match the overall structure and parameter values of these problems. Of particular interest are management problems that can be modeled using a network structure. This paper discusses the design of a system for generating network-based mathematical programming test problems that conform to user-supplied structural and parameter characteristics.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Barr, F. Glover, and D. Klingman, “Enhancements of Spanning Tree Labeling Procedures for Network Optimization,” Research Report CCS 262, Center for Cybernetic Studies, The University of Texas at Austin, (1976).
G. Bradley, G. Brown, and G. Graves, “Design and Implementation of Large-Scale Primal Transshipment Algorithms,” Management Science 24, 1 (1977) 1–34.
J. C. P. Bus, “A Proposal for the Classification and Documentation of Test Problems in the Field of Nonlinear Programming,” Report No. NN 9/77, Stichting Mathematisch Centrum 2 e Boerhaavestraat 49 Amsterdam 1005, HOLAND, (1977).
J. Burruss, J. Elam, and D. Klingman, “NETGEN-II: User’s Manual”, Research Report, Center for Cybernetic Studies, The University of Texas at Austin, (1980).
J. Burruss, J. Elam, and D. Klingman, “The Design of a Generator for Structured Network-Based Problems,” Research Report, Center for Cybernetic Studies, The University of Texas at Austin, (1980).
A. Geoffrion, “Comments on Mathematical Programming Project Panel on Futures,” SHARE XIV Meeting, Los Angeles, (1975).
F. Glover, D. Karney, and D. Klingman, “The Augmented Predecessor Index Method for Locating Stepping Stone Paths and Assigning Dual Prices in Distribution Problems,” Transportation Science 6,2 (1972) 171–179.
F. Glover, D. Karney, and D. Klingman, “Implementation and Computational Study on Start Procedures and Basis Change Criteria for a Primal Network Code,” Networks 4,3 (1974) 191–212.
F. Glover and D. Klingman, “The Simplex SON Algorithm for LP/Embedded Network Problems,” Research Report CCS 317, Center for Cybernetic Studies, The University of Texas at Austin (1977).
F. Glover and J. Mulvey, “Equivalence of the 0–1 Integer Programming Problem to Discrete Generalized and Pure Networks,” Operations Research, 28, 3 (1980), 829–836.
J. Haldi, “25 Integer Programming Test Problems,” Working Paper No. 43, Graduate School of Business, Stanford University.
D. Klingman, A. Napier, and J. Stutz, “NETGEN: A Program for Generating Large-Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems,” Management Science 20, 5 (1974) 814–821.
J. Rosen and S. Suzuki, “Construction of Nonlinear Programming Test Problems,” Comm. ACM 8, 2 (1965) 113.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elam, J.J., Klingman, D. (1982). Netgen-II: A System for Generating Structured Network-Based Mathematical Programming Test Problems. In: Mulvey, J.M. (eds) Evaluating Mathematical Programming Techniques. Lecture Notes in Economics and Mathematical Systems, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95406-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-95406-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11495-6
Online ISBN: 978-3-642-95406-1
eBook Packages: Springer Book Archive