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

D. Klingman, A. Napier and J. Stutz
Additional contact information
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

Management Science, 1974, vol. 20, issue 5, 814-821

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.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (68)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.5.814 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:20:y:1974:i:5:p:814-821

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().