Flows over time in time-varying networks: Optimality conditions and strong duality

•Studying a general class of network flows over time in a continuous-time model.•Developing the key concepts and techniques that are the cornerstones of static network flows.•Establishing reduced cost and negative cycle optimality conditions.•Deriving a strong duality result from these optimality co...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 237; číslo 2; s. 580 - 589
Hlavní autoři: Koch, Ronald, Nasrabadi, Ebrahim
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.09.2014
Elsevier Sequoia S.A
Témata:
Continuous linear programming
Cost engineering
Cost reduction
Duality
Dynamic programming
Dynamics
Flows over time
Graphs
Network flow problem
Networks
Operational research
Optimality conditions
Optimization
Optimization techniques
State of the art
Studies
Continuous linear programming
Optimality conditions
Flows over time
Duality
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Studying a general class of network flows over time in a continuous-time model.•Developing the key concepts and techniques that are the cornerstones of static network flows.•Establishing reduced cost and negative cycle optimality conditions.•Deriving a strong duality result from these optimality conditions. There has been much research on network flows over time due to their important role in real world applications. This has led to many results, but the more challenging continuous time model still lacks some of the key concepts and techniques that are the cornerstones of static network flows. The aim of this paper is to advance the state of the art for dynamic network flows by developing the continuous time analogues of the theory for static network flows. Specifically, we make use of ideas from the static case to establish a reduced cost optimality condition, a negative cycle optimality condition, and a strong duality result for a very general class of network flows over time.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2014.01.051