A faster strongly polynomial minimum cost flow algorithm

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1988, Pages 377-387

  Orlin, James B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST ACCOUNTING; GRAPH THEORY; POLYNOMIALS;

MINIMUM COST FLOW PROBLEM; MINIMUM COST FLOWS; SHORTEST PATH PROBLEM; STRONGLY POLYNOMIAL ALGORITHM; STRONGLY POLYNOMIALS; UPPER BOUND;

ALGORITHMS;

EID: 84898938361     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62212.62249     Document Type: Conference Paper

References (0)