Testing of a large-scale network optimization program

Research output: Contribution to journalArticle

25 Scopus citations

Abstract

This paper describes the experimental results of testing a "large-scale" program for solving minimum-cost network flow problems. With this program, general structure transshipment problems with over ten thousand nodes and thirty thousand arcs have been easily solved without resorting to auxiliary storage. The algorithm is a variant of the primal revised simplex method; the computer code is called LPNET illustrating the close connection between linear programming and network graphs. This approach substantially improves computer processing time and core storage, especially for relatively large network problems. The results of these experiments are provided. It is emphasized that an organized experimental design and a detailed series of empirical tests are crucial for an efficient implementation.

Original languageEnglish (US)
Pages (from-to)291-314
Number of pages24
JournalMathematical Programming
Volume15
Issue number1
DOIs
StatePublished - Dec 1 1978

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Keywords

  • Computational Experiments
  • Computational Results-Efficiency-Comparison
  • Network Flow Problems
  • Pivotal Selection Methods
  • Scaling Procedure
  • Specific problems in mathematical programming
  • Starting Strategies

Fingerprint Dive into the research topics of 'Testing of a large-scale network optimization program'. Together they form a unique fingerprint.

  • Cite this