RELAXATION METHODS FOR MINIMUM COST ORDINARY AND GENERALIZED NETWORK FLOW PROBLEMS.

Operations Research

Volumn 36, Issue 1, 1988, Pages 93-114

  Bertsekas, Dimitri P ^a   Tseng, Paul ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST ACCOUNTING; MATHEMATICAL STATISTICS - RANDOM NUMBER GENERATION; MATHEMATICAL TECHNIQUES - ALGORITHMS; MATHEMATICAL TECHNIQUES--GRAPH THEORY; OPERATIONS RESEARCH--MATHEMATICAL MODELS;

DUAL COST; MINIMUM COST FLOW PROBLEMS; NETWORK FLOW PROBLEMS; RELAXATION METHODS;

MATHEMATICAL PROGRAMMING, NONLINEAR; MATHEMATICAL PROGRAMMING, LINEAR;

NETWORK FLOW PROBLEMS; RELAXATION METHODS; SIMPLEX/PRIMAL-DUAL CODES;

EID: 0023817929     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.36.1.93     Document Type: Article

References (47)