Constructing maximal dynamic flows from static flows
From MaRDI portal
Publication:5378808
DOI10.1287/OPRE.6.3.419zbMATH Open1414.90066OpenAlexW2076171427MaRDI QIDQ5378808FDOQ5378808
Authors: L. R. jun. Ford, D. R. Fulkerson 
Publication date: 3 June 2019
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.6.3.419
Recommendations
Linear programming (90C05) Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Cited In (only showing first 100 items - show all)
- Minimum cost dynamic flows: The series-parallel case
- Minimax problem of suppressing a communication network
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Minimum flow problem on network flows with time-varying bounds
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- On continuous network flows
- 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
- Flows in strongly regular periodic dynamic resource networks
- Title not available (Why is that?)
- Evacuation planning by earliest arrival contraflow
- Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems
- Stable flows over time
- Multicommodity flows over time: Efficient algorithms and complexity
- Subset Selection in Sparse Matrices
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- Flows in dynamic networks with aggregate arc capacities
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Continuous time dynamic contraflow models and algorithms
- 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
- Minimum Convex Cost Dynamic Network Flows
- The mixed evacuation problem
- Dynamic flows with time-dependent capacities
- A note on the quickest minimum cost transshipment problem
- Maximin problem of communication network synthesis
- An Algorithm for a Dynamic Programming Model of Fractional Flows
- The maximum flow problem: a real-time approach
- A network simplex method for the budget-constrained minimum cost flow problem
- Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure
- Design of one class of transportation networks by dynamic programming
- Minimax regret vertex 2-sink location problem in dynamic path networks
- Multiple sink location problems in dynamic path networks
- Flows over time in time-varying networks: optimality conditions and strong duality
- Minsum \(k\)-sink problem on path networks
- Title not available (Why is that?)
- 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
- A decomposition-based approach for the multiperiod multiproduct distribution planning 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
- Ship Traffic Optimization for the Kiel Canal
- A capacitated network flow optimization approach for short notice evacuation planning
- Pattern-based evacuation planning for urban areas
- Computing the throughput of dynamic networks
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Maritime inventory routing: recent trends and future directions
- Vehicle dispatching with time-dependent travel times
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment
- A model-based approach and analysis for multi-period networks
- Efficient continuous contraflow algorithms for evacuation planning problems
- Dynamic flows with supply and demand in networks with several source and sink nodes
- A survey of dynamic network flows
- Computational complexity of convoy movement planning problems
- Earliest arrival flows in networks with multiple sinks
- Title not available (Why is that?)
- Dynamic network flow location models and algorithms for quickest evacuation planning
- An introduction to dynamic generative networks: minimum cost flow
- Static and dynamic source locations in undirected networks
- Network flows with age dependent decay rates
- Minimax regret 1-median problem in dynamic path networks
- Braess's paradox for flows over time
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- Approximating earliest arrival flows with flow-dependent transit times
- A survey on models and algorithms for discrete evacuation planning network problems
- Maximum flow problem on dynamic generative network flows with time-varying bounds
- Title not available (Why is that?)
- An exact algorithm for a multicommodity min-cost flow over time problem
- Minimax regret 1-sink location problem in dynamic path networks
- Maximal dynamic polymatroid flows and applications
- Title not available (Why is that?)
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- Discrete Newton methods for the evacuation problem
- Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks
- A Reach and Bound algorithm for acyclic dynamic-programming networks
- Title not available (Why is that?)
- Dynamic flows in networks with retarded argument.
- Algorithms for flows over time with scheduling costs
- Title not available (Why is that?)
- Sink location problems in dynamic flow grid networks
- Dynamic flows with supply and demand
- A heuristic algorithm for the earliest arrival flow with multiple sources
- An algorithm for labeling network flow problems
- Maximum flow-based formulation for the optimal location of electric vehicle charging stations
- The Maximum Energy-Constrained Dynamic Flow Problem
- Optimal Rounding of Instantaneous Fractional Flows Over Time
- Minmax regret for sink location on dynamic flow paths with general capacities
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- Time minimizing flows in directed networks
- Dynamic Atomic Congestion Games with Seasonal Flows
- On the Price of Anarchy for Flows over Time
- Some budget applications of the maximal flow
- Dealing with time in the multiple traveling salespersons problem with moving targets
- An exact algorithm for the service network design problem with hub capacity constraints
- A tight bound on the speed-up through storage for quickest multi-commodity flows
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)
