SEND-AND-SPLIT METHOD FOR MINIMUM-CONCAVE-COST NETWORK FLOWS.

Mathematics of Operations Research

Volumn 12, Issue 4, 1987, Pages 634-664

  Erickson, Ranel E ^a   Monma, Clyde L ^a   Veinott Jr , Arthur F ^a  

^a UNIVERSITY OF NEVADA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; INVENTORY CONTROL - COSTS; OPERATIONS RESEARCH; PRODUCTION CONTROL - COSTS;

K-PLANAR NETWORKS; MINIMUM-CONCAVE-COST NETWORK FLOWS; MINIMUM-COST-CHAIN PROBLEM; SEND-AND-SPLIT METHOD;

MATHEMATICAL PROGRAMMING;

EID: 0023456409     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.12.4.634     Document Type: Article

References (58)