Using shortest paths in some transshipment problems with concave costs
- 1 December 1977
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 12 (1) , 18-25
- https://doi.org/10.1007/bf01593766
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Adjacent vertices on transportation polytopesNaval Research Logistics Quarterly, 1975
- An improved version of the out-of-kilter method and a comparative study of computer codesMathematical Programming, 1974
- Augmented Threaded Index Method For Network OptimizationINFOR: Information Systems and Operational Research, 1974
- Concave minimization over a convex polyhedronNaval Research Logistics Quarterly, 1973
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path ProblemManagement Science, 1972
- A Simplex Method for a Class of Nonconvex Separable ProblemsManagement Science, 1970
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959