Skip to main content

A General Network Generator

  • Conference paper
Mathematical Models for Decision Support

Part of the book series: NATO ASI Series ((NATO ASI F,volume 48))

  • 356 Accesses

Abstract

Many planning problems can be formulated as linear or mixed integer programs and solved using mathematical optimization systems such as MPSX-MIP, APEX and others. For realistic applications, however, model generation and data input tend to become critical bottlenecks. A number of general purpose modelling systems, such as GAMS [3], MAGIC [21], XML [9] etc. produce input data in MPS format, but require trained experts to model all but the most simple planning problems. Special purpose matrix generators are widely used but lack flexibility in the model formulation and alteration stage.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Barr, F. Glover, D. Klingman, J. Stutz, Technical Documentation NETGEN, March 1973.

    Google Scholar 

  2. R. Barr, J.S. Turner, “Microdata File Merging Through Large-Scale Network Technology,” Math. Prog. Study 15, 1981, pp. 1–22.

    MATH  Google Scholar 

  3. J. Bisschop and A. Meeraus, “On The Development of A General Algebraic Modeling system in A Strategic Planning Environment,” Math. Prog. Study 20, 1982, pp. 1–29.

    Google Scholar 

  4. R.E. Bixby and W.H. Cunningham, “Converting Linear Programs to Network Problems,” Math. of Ops. Res. 5(3), 1980, pp. 321–357.

    Article  MATH  MathSciNet  Google Scholar 

  5. R.L. Crum and D.J. Nye, “A Network Model of Insurance Company Cash Flow Management,” Math. Prog. Study 15, 1981, pp. 86–101.

    Google Scholar 

  6. W.H. Cunningham, “A Class of Linear Programs Convertible to Network Problems,” Ops. Res. 31(2), 1983, pp. 387–391.

    Article  MATH  MathSciNet  Google Scholar 

  7. J.J. Elam and D. Klingman, “NETGEN-II: A System for Generating Structured Network-Based Mathematical Programming Test Problems,” Lecture Notes in Economics and Mathematical Systems (ed. by J.M. Mulvey), 1982, pp. 16–23.

    Google Scholar 

  8. A. Federgruen and H. Groenevelt, “Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs,” Ops. Res. 34(2), 1978, pp. 218–225.

    Article  Google Scholar 

  9. R. Fourer, “Modelling Languages Versus Matrix Generators for Linear Programming,” ACM Transactions on Math. Software 9(2), 1983, pp. 143–183.

    Article  Google Scholar 

  10. F. Glover, J. Hultz, D. Klingman and J. Stutz, “A New Computer-Based Planning Tool,” Research Report CCS 289, Center for Cybernetic Studies, University of Texas at Austin, 1976.

    Google Scholar 

  11. F. Glover and D. Klingman, “Network Application in Industry and Government,” AIIE Transactions 9, 1977, pp. 363–376.

    Article  Google Scholar 

  12. F. Glover, C. McMillan and D. Klingman, “The NETFORM Concept: A More Effective Model Form and Solution Procedure for Large Scale Nonlinear Problems,” Proc. of ACM 77 (annual conference), Seattle, October 1977, pp. 283–289.

    Google Scholar 

  13. F. Glover, J. Hultz, D. Klingman, “Improved Computer-Based Planning Techniques,” Interfaces 8(4), 1978, pp. 16–25 (part I), Interfaces 9 (4), 1979, pp. 12-20 (part II).

    Article  Google Scholar 

  14. F. Glover, J. Hultz, D. Klingman and J. Stutz, “Generalized Networks: A Fundamental Computer-Based Planning Tool,” Mgmt. Sci. 24(12), 1978, pp. 1209–1220.

    Article  Google Scholar 

  15. F. Glover, G. Jones, D. Karney, D. Klingman and J. Mote, “An Integrated Production, Distribution, and Inventory Planning System,” Interfaces 9(5), 1979, pp. 21–35.

    Article  Google Scholar 

  16. D. Klingman, A. Napier and J. Stutz, “NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems,” Mgmt. Sci. 20(5), 1974, pp. 814–821.

    Article  MATH  MathSciNet  Google Scholar 

  17. R.R. Meyer, “Network Optimization,” in [19].

    Google Scholar 

  18. C.M. Murphy and M.S. Hung, “Network Generation using The Prüfer Code,” Comp. and Ops. Res. 13(6), 1986, pp. 693–705.

    Article  MATH  Google Scholar 

  19. K. Schittkowski (Ed.), Computational Mathematical Programming, NATO ASI Series, Vol.F15, Springer, Berlin, 1985.

    Google Scholar 

  20. R.T. Rockafellar, Network Flows and Monotropic Optimization, John Wiley & Sons, New York, 1984.

    MATH  Google Scholar 

  21. H.P. Williams, “Model Building in Linear and Integer Programming,” in [19].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Forster, M. (1988). A General Network Generator. In: Mitra, G., Greenberg, H.J., Lootsma, F.A., Rijkaert, M.J., Zimmermann, H.J. (eds) Mathematical Models for Decision Support. NATO ASI Series, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83555-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83555-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83557-5

  • Online ISBN: 978-3-642-83555-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics