Constructing maximal dynamic flows from static flows
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Network flows with age dependent decay rates
- Maximal dynamic polymatroid flows and applications
- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
- Efficient continuous-time dynamic network flow algorithms
- Solving a class of network models for dynamic flow control
- The mixed evacuation problem
- 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
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- A polynomial time algorithm for the minimum flow problem in time-varying networks
- Stable flows over time
- An exact algorithm for a multicommodity min-cost flow over time problem
- Step graphs and their application to the organization of commodity flows in networks
- Continuous time dynamic contraflow models and algorithms
- A network simplex method for the budget-constrained minimum cost flow problem
- Robust flows over time: models and complexity results
- A tight bound on the speed-up through storage for quickest multi-commodity flows
- Vehicle dispatching with time-dependent travel times
- On continuous network flows
- A capacitated network flow optimization approach for short notice evacuation planning
- A heuristic algorithm for the earliest arrival flow with multiple sources
- Maximin problem of communication network synthesis
- Heterogeneous multi-commodity network flows over time
- Algorithms for flows over time with scheduling costs
- Minmax regret for sink location on dynamic flow paths with general capacities
- Dealing with time in the multiple traveling salespersons problem with moving targets
- Equilibria in routing games with edge priorities
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Flows over time in time-varying networks: optimality conditions and strong duality
- Minsum \(k\)-sink problem on path networks
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- Minmax regret k-sink location on a dynamic path network with uniform capacities
- Discrete Newton methods for the evacuation problem
- A decomposition-based approach for the multiperiod multiproduct distribution planning problem
- Minimax regret 1-sink location problem in dynamic path networks
- Evacuation planning by earliest arrival contraflow
- On the complexity and approximability of budget-constrained minimum cost flows
- Multicommodity flows over time: Efficient algorithms and complexity
- An adaptive routing approach for personal rapid transit
- Continuous dynamic contraflow approach for evacuation planning
- Efficient continuous contraflow algorithms for evacuation planning problems
- A survey on models and algorithms for discrete evacuation planning network problems
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Dynamic network flow location models and algorithms for quickest evacuation planning
- Dynamic flows with supply and demand in networks with several source and sink nodes
- Dynamic flows in networks with retarded argument.
- Dynamic flows with supply and demand
- Flows on graphs with varying transit times through the arcs
- The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment
- An introduction to network flows over time
- Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations
- Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure
- scientific article; zbMATH DE number 3850822 (Why is no real title available?)
- Time minimizing flows in directed networks
- scientific article; zbMATH DE number 3870996 (Why is no real title available?)
- Some budget applications of the maximal flow
- The Maximum Energy-Constrained Dynamic Flow Problem
- A model-based approach and analysis for multi-period networks
- A Reach and Bound algorithm for acyclic dynamic-programming networks
- Periodic dynamic graphs. Maximum flow problem
- Minimum Convex Cost Dynamic Network Flows
- scientific article; zbMATH DE number 3918059 (Why is no real title available?)
- scientific article; zbMATH DE number 3959081 (Why is no real title available?)
- scientific article; zbMATH DE number 3959082 (Why is no real title available?)
- scientific article; zbMATH DE number 3972590 (Why is no real title available?)
- scientific article; zbMATH DE number 3980874 (Why is no real title available?)
- scientific article; zbMATH DE number 4031365 (Why is no real title available?)
- scientific article; zbMATH DE number 4057258 (Why is no real title available?)
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- An Algorithm for a Dynamic Programming Model of Fractional Flows
- scientific article; zbMATH DE number 67667 (Why is no real title available?)
- Pattern-based evacuation planning for urban areas
- scientific article; zbMATH DE number 1342127 (Why is no real title available?)
- scientific article; zbMATH DE number 617941 (Why is no real title available?)
- scientific article; zbMATH DE number 1741775 (Why is no real title available?)
- scientific article; zbMATH DE number 1062936 (Why is no real title available?)
- The maximum flow problem: a real-time approach
- scientific article; zbMATH DE number 1102865 (Why is no real title available?)
- Optimal Rounding of Instantaneous Fractional Flows Over Time
- scientific article; zbMATH DE number 1490953 (Why is no real title available?)
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- scientific article; zbMATH DE number 6913891 (Why is no real title available?)
- Maximum flows in planar dynamic networks with lower bounds
- The maximum flows in bipartite dynamic networks. The static approach
- scientific article; zbMATH DE number 754202 (Why is no real title available?)
- A feedback strategy for periodic network flows
- scientific article; zbMATH DE number 6125195 (Why is no real title available?)
- Computational complexity of convoy movement planning problems
- Subset selection in sparse matrices
- Earliest arrival flows in networks with multiple sinks
- Dynamic Atomic Congestion Games with Seasonal Flows
- Maximum flows in bipartite dynamic networks
- Maximum contraflow evacuation planning problems on multi-network
- Dynamic network contraflow evacuation planning problem with continuous time approach
- A critical survey on the network optimization algorithms for evacuation planning problems
- Maximum FlowLoc problems with network reconfiguration
- Long-term behavior of dynamic equilibria in fluid queuing networks
- Flows in strongly regular periodic dynamic resource networks
- Algorithms for Flows over Time with Scheduling Costs
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)
