Back to Search
Start Over
Algorithms.
- Source :
-
Communications of the ACM . Sep68, Vol. 11 Issue 9, p631-633. 3p. - Publication Year :
- 1968
-
Abstract
- This article presents procedures for solving of equations related to algorithm. Procedure determines the least-cost flow over an upper and lower bound capacitated flow network. Each directed network arc a is defined by nodes I[a] and J[a], has upper and lower flow bounds hi{a] and lo[a], and cost per unit of flow cost[a]. Costs and flow bounds may be any positive or negative integers. An upper flow bound must be greater than or equal to its corresponding lower flow bound for a feasible solution to exist. There may be any number of parallel arcs connecting any two nodes.
Details
- Language :
- English
- ISSN :
- 00010782
- Volume :
- 11
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Communications of the ACM
- Publication Type :
- Periodical
- Accession number :
- 17836896