A composite algorithm for a concave‐cost network flow problem

Publisher Website

1 March 1989

journal article
Published by Wiley in Networks

Vol. 19 (2), 175-202
https://doi.org/10.1002/net.3230190202

Abstract

No abstract available

Keywords

This publication has 10 references indexed in Scilit:

Send-and-Split Method for Minimum-Concave-Cost Network Flows
Mathematics of Operations Research, 1987
Network Design and Transportation Planning: Models and Algorithms
Transportation Science, 1984
The load planning problem of motor carriers: Problem description and a proposed solution approach
Transportation Research Part A: General, 1983
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Management Science, 1981
Concave cost minimization on networks
European Journal of Operational Research, 1979
The complexity of the network design problem
Networks, 1978
Optimal Facility Location with Concave Costs
Operations Research, 1974
Lagrangean relaxation for integer programming
Published by Springer Nature ,1974
Minimum Concave Cost Flows in Certain Networks
Management Science, 1968
A note on two problems in connexion with graphs
Numerische Mathematik, 1959

Cited by 82 articles