On solving continuous-time dynamic network flows
From MaRDI portal
Publication:453631
DOI10.1007/s10898-011-9723-0zbMath1250.90100OpenAlexW2048828481MaRDI QIDQ453631
S. Mehdi Hashemi, Ebrahim Nasrabadi
Publication date: 27 September 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15647
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (5)
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies ⋮ Unnamed Item ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Unnamed Item ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic shortest path problems with time-varying costs
- A survey of dynamic network flows
- A simplex based algorithm to solve separated continuous linear programs
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- An Introduction to Network Flows over Time
- Algorithms for Finding Optimal Flows in Dynamic Networks
- Minimum cost time-varying network flow problems
- Some Properties of a Class of Continuous Linear Programs
- A continuous-time network simplex algorithm
- Extreme Points for Continuous Network Programs with Arc Delays
- A Class of Continuous Network Flow Problems
- A New Algorithm for State-Constrained Separated Continuous Linear Programs
- An Algorithm for a Class of Continuous Linear Programs
- Existence and duality theory for separated continuous linear programs
- A Study of General Dynamic Network Programs with Arc Time-Delays
- Minimum-cost dynamic flows: The series-parallel case
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- An adaptive discretization algorithm for a class of continuous network programs
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- A Duality Theory for Separated Continuous Linear Programs
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- Continuous-Time Flows in Networks
This page was built for publication: On solving continuous-time dynamic network flows
