IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v20y1974i5p814-821.html
   My bibliography  Save this article

NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

Author

Listed:
  • D. Klingman

    (Associate Professor of Operations Research at the University of Texas, Austin, Texas)

  • A. Napier

    (Research Associate, Operations Research Division, Continental Oil Company, Houstan, Texas)

  • J. Stutz

    (Assistant Professor of Operations Research at the University of Texas, Austin, Texas)

Abstract

The purpose of this paper is to describe the development, implementation, and availability of a computer program for generating a variety of feasible network problems together with a set of benchmarked problems derived from it. The code "NETGEN" can generate capacitated and uncapacitated transportation and minimum cost flow network problems, and assignment problems. In addition to generating structurally different classes of network problems the code permits the user to vary structural characteristics within a class. Problems benchmarked on several codes currently available are provided in this paper since NETGEN will also allow other researchers to generate identical problems. In particular, the latter part of the paper contains the solution time and objective function value of 40 assignment, transportation, and network problems varying in size from 200 nodes to 8,000 nodes and from 1,300 arcs to 35,000 arcs.

Suggested Citation

  • D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    • Handle: RePEc:inm:ormnsc:v:20:y:1974:i:5:p:814-821
    DOI: 10.1287/mnsc.20.5.814
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.20.5.814
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.20.5.814?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:20:y:1974:i:5:p:814-821. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.