Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- 1 December 1990
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 25 (1) , 75-99
- https://doi.org/10.1007/bf02283688
Abstract
No abstract availableThis publication has 80 references indexed in Scilit:
- A composite algorithm for a concave‐cost network flow problemNetworks, 1989
- Enumerative techniques for solving some nonconvex global optimization problemsOR Spectrum, 1988
- Constrained Global Optimization: Algorithms and ApplicationsPublished by Springer Nature ,1987
- Nonlinear cost network models in transportation analysisPublished by Springer Nature ,1986
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location ProblemManagement Science, 1977
- The Fixed-Charge Transportation Problem: A Computational Study with a Branch-and-Bound CodeA I I E Transactions, 1976
- An approximative algorithm for the fixed charge problemNaval Research Logistics Quarterly, 1969
- A branch‐bound algorithm for the capacitated facilities location problemNaval Research Logistics Quarterly, 1969
- On an Integer Program for a Delivery ProblemOperations Research, 1964
- Fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1961