NETGEN: A Program for Generating Large Scale (UN)Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
Abstract
One purpose of the paper is to describe the development, implementation, and availability of a computer program for generating a variety of feasible network problems. In particular the code can generate capacitated and uncapacitated transportation and minimum cost flow network problems, and assignment problems. In particular the code 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. Since researchers can generate identical networks using this code, another purpose of the paper is to provide problems benchmarked on several codes currently available. In particular, the later part of the paper contains the solution time and objective function value on 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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1973
- Accession Number
- AD0757983
Entities
People
- A. Napier
- Darwin Dee Klingman
- J. Stutz
Organizations
- University of Texas at Austin