Flows over time in time-varying networks: optimality conditions and strong duality
From MaRDI portal
Publication:2253989
DOI10.1016/j.ejor.2014.01.051zbMath1304.90054OpenAlexW2020437783MaRDI QIDQ2253989
Ebrahim Nasrabadi, Ronald Koch
Publication date: 4 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.01.051
Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48)
Related Items
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ A polynomial time algorithm for the minimum flow problem in time-varying networks ⋮ Managing high-end ex-demonstration product returns
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving continuous-time dynamic network flows
- Continuous and discrete flows over time
- A simplex based algorithm to solve separated continuous linear programs
- Efficient continuous-time dynamic network flow algorithms
- Least possible time paths in stochastic, time-varying networks.
- On solving quickest time problems in time-dependent, dynamic networks
- On continuous network flows
- Multicriteria adaptive paths in stochastic, time-varying networks
- Continuous-Time Dynamic Shortest Path Problems with Negative Transit Times
- An Introduction to Network Flows over Time
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Minimum cost time-varying network flow problems
- A continuous-time network simplex algorithm
- Extreme Points for Continuous Network Programs with Arc Delays
- A Class of Continuous Network Flow Problems
- Minimum weight paths in time-dependent networks
- An Algorithm for a Class of Continuous Linear Programs
- Time-varying shortest path problems with constraints
- Existence and duality theory for separated continuous linear programs
- A Study of General Dynamic Network Programs with Arc Time-Delays
- A Duality Theory for Separated Continuous Linear Programs
- Constructing Maximal Dynamic Flows from Static Flows
- Quickest Flows Over Time
- Continuous-Time Flows in Networks
- Time-varying minimum cost flow problems
