Constructing maximal dynamic flows from static flows
From MaRDI portal
Publication:5378808
Recommendations
Cited in
(only showing first 100 items - show all)- Minimax regret 1-sink location problem in dynamic path networks
- An introduction to network flows over time
- Maritime inventory routing: recent trends and future directions
- A survey of dynamic network flows
- Network flows with age dependent decay rates
- A capacitated network flow optimization approach for short notice evacuation planning
- Computational complexity of convoy movement planning problems
- Flows over time in time-varying networks: optimality conditions and strong duality
- An Algorithm for a Dynamic Programming Model of Fractional Flows
- Earliest arrival flows in networks with multiple sinks
- Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations
- Design of one class of transportation networks by dynamic programming
- Multiple sink location problem in path networks with a combinational objective
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
- Equilibria in routing games with edge priorities
- Minimum Convex Cost Dynamic Network Flows
- The maximum flow problem: a real-time approach
- Maximum contraflow evacuation planning problems on multi-network
- Evacuation planning by earliest arrival contraflow
- The maximum flows in bipartite dynamic networks. The static approach
- scientific article; zbMATH DE number 67667 (Why is no real title available?)
- The mixed evacuation problem
- Maximum flows in planar dynamic networks with lower bounds
- Maximum flow problem on dynamic generative network flows with time-varying bounds
- Maximal dynamic polymatroid flows and applications
- Minimax regret vertex 2-sink location problem in dynamic path networks
- Minimax problem of suppressing a communication network
- Vehicle dispatching with time-dependent travel times
- On the complexity and approximability of budget-constrained minimum cost flows
- Multicommodity flows over time: Efficient algorithms and complexity
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- Continuous dynamic contraflow approach for evacuation planning
- The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment
- Minsum \(k\)-sink problem on path networks
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- 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
- Minimum cost dynamic flows: the series-parallel case
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- Dynamic network flow location models and algorithms for quickest evacuation planning
- Subset selection in sparse matrices
- A model-based approach and analysis for multi-period networks
- Continuous time dynamic contraflow models and algorithms
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- Pattern-based evacuation planning for urban areas
- Maximum flows in bipartite dynamic networks
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- An exact algorithm for a multicommodity min-cost flow over time problem
- Efficient continuous contraflow algorithms for evacuation planning problems
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems
- An introduction to dynamic generative networks: minimum cost flow
- A critical survey on the network optimization algorithms for evacuation planning problems
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Ship traffic optimization for the Kiel Canal
- Approximating earliest arrival flows with flow-dependent transit times
- Static and dynamic source locations in undirected networks
- Computing the throughput of dynamic networks
- Flows in dynamic networks with aggregate arc capacities
- A network simplex method for the budget-constrained minimum cost flow problem
- A survey on models and algorithms for discrete evacuation planning network problems
- Dynamic flows with time-dependent capacities
- Flows in strongly regular periodic dynamic resource networks
- An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks
- Stable flows over time
- Step graphs and their application to the organization of commodity flows in networks
- Dynamic flows with supply and demand in networks with several source and sink nodes
- A note on the quickest minimum cost transshipment problem
- Multiple sink location problems in dynamic path networks
- Maximin problem of communication network synthesis
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- A polynomial time algorithm for the minimum flow problem in time-varying networks
- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
- Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure
- Minimum flow problem on network flows with time-varying bounds
- On continuous network flows
- scientific article; zbMATH DE number 3870996 (Why is no real title available?)
- Maximum flow-based formulation for the optimal location of electric vehicle charging stations
- Heterogeneous multi-commodity network flows over time
- Sink location problems in dynamic flow grid networks
- The Maximum Energy-Constrained Dynamic Flow Problem
- Some networks that allow splashes of dynamic flows and finding the maximum splash value
- scientific article; zbMATH DE number 3972590 (Why is no real title available?)
- scientific article; zbMATH DE number 6913891 (Why is no real title available?)
- Some budget applications of the maximal flow
- scientific article; zbMATH DE number 3918059 (Why is no real title available?)
- Shortest path or random walks? A framework for path weights in network meta-analysis
- scientific article; zbMATH DE number 3980874 (Why is no real title available?)
- Discrete Newton methods for the evacuation problem
- Optimal Rounding of Instantaneous Fractional Flows Over Time
- scientific article; zbMATH DE number 6125195 (Why is no real title available?)
- Algorithms for flows over time with scheduling costs
- 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
- Periodic dynamic graphs. Maximum flow problem
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
- One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
- Maximum FlowLoc problems with network reconfiguration
- Dynamic flows with supply and demand
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)
