A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems-Reference-Cited by-同舟云学术

A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems

Published:2006-10 Issue:2 Volume:174 Page:1205-1219
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Fontes Dalila B.M.M.,Hadjiconstantinou Eleni,Christofides Nicos

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference37 articles.

1. Data structures and algorithms;Aho,1983

2. J.E. Beasley, Or-Library, Available from .

3. Dynamic programming;Bellman,1957

4. Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks;Burkard;Journal of Global Optimization,2001

5. On the mathematical theory of isomers;Cayley;Philosophical Magazine,1874

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. China's optimal development pathway of intermittent renewable power towards carbon neutrality;Journal of Cleaner Production;2023-06

2. Intermodal Hinterland Network Design Games;Transportation Science;2020-09

3. Study of China's optimal solar photovoltaic power development path to 2050;Resources Policy;2020-03

4. Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions;Applied Soft Computing;2020-01

5. A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems;Soft Computing;2019-03-29