A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
Authors:
- Dalila B.M.M. FontesDFDalila B.M.M. Fontes
- Eleni HadjiconstantinouEHEleni Hadjiconstantinou
- Nicos ChristofidesNCNicos Christofides
- 1 October 2006
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 174 (2) , 1205-1219
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problemsNetworks, 2003
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problemNetworks, 2003
- bc-opt: a branch-and-cut code for mixed integer programsMathematical Programming, 1999
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedureOperations Research Letters, 1999
- Cash flow management network models with quantity discountingOmega, 1994
- Global search algorithms for minimum concave-cost network flow problemsJournal of Global Optimization, 1991
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problemJournal of Global Optimization, 1991
- Analysis of a flow problem with fixed chargesNetworks, 1989
- Enumerative techniques for solving some nonconvex global optimization problemsOR Spectrum, 1988
- An algorithm for the min concave cost flow problemEuropean Journal of Operational Research, 1980