On solving continuous-time dynamic network flows
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3934807 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 934458 (Why is no real title available?)
- A Class of Continuous Network Flow Problems
- A Duality Theory for Separated Continuous Linear Programs
- A New Algorithm for State-Constrained Separated Continuous Linear Programs
- A Study of General Dynamic Network Programs with Arc Time-Delays
- A continuous-time network simplex algorithm
- A simplex based algorithm to solve separated continuous linear programs
- A suggested computation for maximal multi-commodity network flows
- A survey of dynamic network flows
- Algorithms for finding optimal flows in dynamic networks
- An Algorithm for a Class of Continuous Linear Programs
- An adaptive discretization algorithm for a class of continuous network programs
- An introduction to network flows over time
- Continuous-Time Flows in Networks
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- Dynamic flows in time-varying networks.
- Dynamic shortest path problems with time-varying costs
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- Existence and duality theory for separated continuous linear programs
- Extreme Points for Continuous Network Programs with Arc Delays
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum cost time-varying network flow problems
- Minimum-cost dynamic flows: The series-parallel case
- Network flows. Theory, algorithms, and applications.
- Some Properties of a Class of Continuous Linear Programs
Cited in
(17)- Continuous and discrete flows over time
- Continuous-time dynamic shortest path problems with negative transit times
- scientific article; zbMATH DE number 6913891 (Why is no real title available?)
- Flows over time in time-varying networks: optimality conditions and strong duality
- An adaptive discretization algorithm for a class of continuous network programs
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies
- Modelling and optimisation of flows on networks. Cetraro, Italy 2009. Papers based on the presentations at the CIME course, June 15--19, 2009
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- Exact solution of network flow models with strong relaxations
- Determining the optimal flows in zero-time dynamic networks
- Dynamic flows in time-varying networks.
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- Dynamic network contraflow evacuation planning problem with continuous time approach
- scientific article; zbMATH DE number 176474 (Why is no real title available?)
- The Continuous-Time Service Network Design Problem
- A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota
- Continuous-Time Flows in Networks
This page was built for publication: On solving continuous-time dynamic network flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453631)
