Minimum Convex and Differentiable Cost Flow Problem with Time Windows
Keywords:
Minimum Cost Flow Problem, Combinatorial Optimization, Network Optimization, Time windowsAbstract
This paper presents a new version of the Minimum Cost Flow Problem (MCFP). This version is the Minimum Convex and Differentiable Cost Flow Problem with Time Windows (MCDCFPTW). Given a directed graph G=(V,A), where V is a set of vertices, A is a set of arcs. Each vertex i has a time-window [ai,bi] within which the vertex i may be visited with a non-negative service time ti where,ai<ti<bi. Each arc (i,j) is associated with three
References
K. Ahuja, L. Magnanti, B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-hall, Inc. New Jersey, 1993.
D. Boyles, T. Waller.
G. Busacker, J. Gowen.
B. Dimitri, R. Gallager. Data Networks. Prentice-Hall International, Inc, 1992.
N. El-Sherbeny.
N. El-Sherbeny.
N. El-Sherbeny.
N. El-Sherbeny.
M. Ermolev, M. Mel
L. Ford, D. Fulkerson. Rows in networks. Princeton University Press, Princeton, New Jersey, 1962.
L. Ford and D. Fulkerson.
R. Fulkerson.
M. Gathee, M. Hashemi.
V. Goldberg, E. Tarjan.
M. Hashemi, M.Ghatee, E. Nasrabadi.
C. Hu.
V. Kamesam, R. Meyer.
S. Kapoor, P. Vaidya.
M. klein.
P. Klein, S. Plotkin, C. Stein, E. Tardos.
T. Leighton, S. Rao.
R. Meyer.
K. Trustrum. Linear programming. Routledge and Keegan Paul, London, 1971.
D. Tuyttens, J. Teghem, N. El-Sherbeny.
Downloads
Published
How to Cite
Issue
Section
License
Authors who submit papers with this journal agree to the following terms.
