A survey of dynamic network flows

From MaRDI portal
Publication:917417

DOI10.1007/BF02216922zbMath0704.90028MaRDI QIDQ917417

Jay E. Aronson

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)




Related Items

Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\), Flows in strongly regular periodic dynamic resource networks, Solving a class of network models for dynamic flow control, Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle, Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system, Minmax regret for sink location on dynamic flow paths with general capacities, Graceful reassignment of excessively long communications paths in networks, Multicommodity flows over time: Efficient algorithms and complexity, Flows in dynamic networks with aggregate arc capacities, On the motion of substance in a channel of a network and human migration, Minimum parametric flow in time-dependent dynamic networks, Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration, Resource downgrading, Pricing and balancing of the sea-cargo service chain with empty equipment repositioning, A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem, An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks, Statistical distributions connected to motion of substance in a channel of a network, A model-based approach and analysis for multi-period networks, Continuous dynamic contraflow approach for evacuation planning, Efficient continuous contraflow algorithms for evacuation planning problems, Single source single-commodity stochastic network design, Allocation of empty containers between multi-ports, Algorithms for the quickest time distribution of dynamic stochastic-flow networks, Minimum cost dynamic flows: The series-parallel case, Metaheuristics for the work‐troops scheduling problem, The quickest flow problem, A note on the quickest minimum cost transshipment problem, Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows, Temporal flows in temporal networks, Branch-and-cut for a 2-commodity flow relocation model with time constraints, Pattern-based evacuation planning for urban areas, The Maximum Energy-Constrained Dynamic Flow Problem, Optimal egress time calculation and path generation for large evacuation networks, Continuous and discrete flows over time, Determining the optimal flows in zero-time dynamic networks, An Introduction to Network Flows over Time, Dynamic graph generation for the shortest path problem in time expanded networks, Algorithms for Finding Optimal Flows in Dynamic Networks, Facets of the Stochastic Network Flow Problem, On solving continuous-time dynamic network flows, Nash equilibria and the price of anarchy for flows over time, Unnamed Item, Unnamed Item, An introduction to dynamic generative networks: minimum cost flow, On solving maximum and quickest interval-valued flows over time, A polynomial time algorithm for the minimum flow problem in time-varying networks, Computational complexity of convoy movement planning problems, Lot sizing with inventory gains, Truck dock assignment problem with operational time constraint within crossdocks, Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm, Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks, Minimum flow problem on network flows with time-varying bounds, Universally maximum flow with piecewise-constant capacities, A heuristic algorithm for the earliest arrival flow with multiple sources, Maximum flow problem on dynamic generative network flows with time-varying bounds, Robust flows over time: models and complexity results, A minmax regret version of the time-dependent shortest path problem, A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem, Partial contraflow with path reversals for evacuation planning, A survey on models and algorithms for discrete evacuation planning network problems, Unnamed Item, Traffic Networks and Flows over Time, One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints, On the motion of substance in a channel and growth of random networks, A decomposition-based approach for the multiperiod multiproduct distribution planning problem, Iterative improvement methods for a multiperiod network design problem, Heterogeneous multi-commodity network flows over time, Efficient continuous-time dynamic network flow algorithms, Abstract network flow with intermediate storage for evacuation planning, Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters, A tabu search heuristic procedure for the fixed charge transportation problem, A new hierarchical architecture for air traffic management: optimisation of airway capacity in a free flight scenario, Optimization and sustainable development


Uses Software


Cites Work