A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

Saved in:
Bibliographic Details
Published inAlgorithmica Vol. 39; no. 3; pp. 189 - 208
Main Authors Ahuja, Ravindra K., Hochbaum, Dorit S., Orlin, James B.
Format Journal Article
LanguageEnglish
Published New York, NY Springer 01.07.2004
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Theoretical computing
Cost minimization
Network flow
Logarithmic function
Non linear function
Duality
Non linear programming
Nonlinear integer programming. Convex integer programming
Convex programming
Unimodularity
Integer programming
Total unimodularity
Minimum cut
Objective function
Online AccessGet full text
ISSN0178-4617
1432-0541
DOI10.1007/s00453-004-1085-2

Cover

More Information
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-004-1085-2