Constructing maximal dynamic flows from static flows
From MaRDI portal
Publication:5378808
Recommendations
Cited in
(only showing first 100 items - show all)- A survey of dynamic network flows
- scientific article; zbMATH DE number 3850822 (Why is no real title available?)
- Dynamic flows with supply and demand in networks with several source and sink nodes
- scientific article; zbMATH DE number 1741775 (Why is no real title available?)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Computational complexity of convoy movement planning problems
- Earliest arrival flows in networks with multiple sinks
- Flows on graphs with varying transit times through the arcs
- An introduction to dynamic generative networks: minimum cost flow
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
- Static and dynamic source locations in undirected networks
- Dynamic network flow location models and algorithms for quickest evacuation planning
- scientific article; zbMATH DE number 67667 (Why is no real title available?)
- Network flows with age dependent decay rates
- Shortest path or random walks? A framework for path weights in network meta-analysis
- scientific article; zbMATH DE number 6913891 (Why is no real title available?)
- Periodic dynamic graphs. Maximum flow problem
- scientific article; zbMATH DE number 3870996 (Why is no real title available?)
- An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks
- Approximating earliest arrival flows with flow-dependent transit times
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- A survey on models and algorithms for discrete evacuation planning network problems
- An introduction to network flows over time
- Maximum flow problem on dynamic generative network flows with time-varying bounds
- Ship traffic optimization for the Kiel Canal
- scientific article; zbMATH DE number 3959081 (Why is no real title available?)
- On the price of anarchy for flows over time
- Scalable timing-aware network design via Lagrangian decomposition
- An exact algorithm for a multicommodity min-cost flow over time problem
- Heterogeneous multi-commodity network flows over time
- Maximal dynamic polymatroid flows and applications
- Minimax regret 1-sink location problem in dynamic path networks
- One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
- Minimax problem of suppressing a communication network
- Synchronized traveling salesman problem
- Minimum flow problem on network flows with time-varying bounds
- Maximum flows in bipartite dynamic networks
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations
- Multiple sink location problem in path networks with a combinational objective
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
- On continuous network flows
- Discrete Newton methods for the evacuation problem
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- A Reach and Bound algorithm for acyclic dynamic-programming networks
- Flows in strongly regular periodic dynamic resource networks
- scientific article; zbMATH DE number 3972590 (Why is no real title available?)
- Dynamic flows in networks with retarded argument.
- Evacuation planning by earliest arrival contraflow
- Stable flows over time
- Algorithms for flows over time with scheduling costs
- Multicommodity flows over time: Efficient algorithms and complexity
- Flows in dynamic networks with aggregate arc capacities
- Some networks that allow splashes of dynamic flows and finding the maximum splash value
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Continuous time dynamic contraflow models and algorithms
- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
- A polynomial time algorithm for the minimum flow problem in time-varying networks
- The mixed evacuation problem
- Minimum Convex Cost Dynamic Network Flows
- Dynamic flows with supply and demand
- Maximum contraflow evacuation planning problems on multi-network
- A heuristic algorithm for the earliest arrival flow with multiple sources
- Sink location problems in dynamic flow grid networks
- The maximum flow problem: a real-time approach
- Maximin problem of communication network synthesis
- The Maximum Energy-Constrained Dynamic Flow Problem
- An Algorithm for a Dynamic Programming Model of Fractional Flows
- Dynamic flows with time-dependent capacities
- An algorithm for labeling network flow problems
- Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure
- A note on the quickest minimum cost transshipment problem
- A network simplex method for the budget-constrained minimum cost flow problem
- Maximum flow-based formulation for the optimal location of electric vehicle charging stations
- Design of one class of transportation networks by dynamic programming
- Minmax regret for sink location on dynamic flow paths with general capacities
- Optimal Rounding of Instantaneous Fractional Flows Over Time
- Multiple sink location problems in dynamic path networks
- Minimax regret vertex 2-sink location problem in dynamic path networks
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
- Time minimizing flows in directed networks
- Flows over time in time-varying networks: optimality conditions and strong duality
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- Minsum \(k\)-sink problem on path networks
- Minimum cost dynamic flows: the series-parallel case
- Equilibria in routing games with edge priorities
- On the complexity and approximability of budget-constrained minimum cost flows
- Continuous dynamic contraflow approach for evacuation planning
- The maximum flows in bipartite dynamic networks. The static approach
- Maximum flows in planar dynamic networks with lower bounds
- A decomposition-based approach for the multiperiod multiproduct distribution planning problem
- Maximum FlowLoc problems with network reconfiguration
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
- A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
- Dynamic Atomic Congestion Games with Seasonal Flows
- A capacitated network flow optimization approach for short notice evacuation planning
- Some budget applications of the maximal flow
- Dealing with time in the multiple traveling salespersons problem with moving targets
This page was built for publication: Constructing maximal dynamic flows from static flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378808)
