The quickest flow problem
From MaRDI portal
Publication:4031968
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- scientific article; zbMATH DE number 42283 (Why is no real title available?)
- scientific article; zbMATH DE number 3614491 (Why is no real title available?)
- scientific article; zbMATH DE number 742963 (Why is no real title available?)
- scientific article; zbMATH DE number 1418034 (Why is no real title available?)
- A bad network problem for the simplex method and other minimum cost flow algorithms
- A new saling algorithm for the maximum mean cut problem
- A survey of dynamic network flows
- Algorithms for the quickest path problem and the enumeration of quickest paths
- An efficient implementation of the network simplex method
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial Optimization with Rational Objective Functions
- Complexity of some parametric integer and network programming problems
- Dual Algorithms for Pure Network Problems
- Faster parametric shortest path and minimum‐balance algorithms
- Fractional programming
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- Maximal, Lexicographic, and Dynamic Network Flows
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- New scaling algorithms for the assignment and minimum mean cycle problems
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- Parametric approaches to fractional programs
- Parametric shortest path algorithms with an application to cyclic staffing
- Primal transportation and transshipment algorithms
- The quickest flow problem
- The quickest path problem
Cited in
(55)- The quickest transshipment problem
- Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study
- An introduction to network flows over time
- The Maximum Energy-Constrained Dynamic Flow Problem
- Earliest arrival flows in networks with multiple sinks
- The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
- Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations
- Complexity analysis for maximum flow problems with arc reversals
- Fast data transmission and maximal dynamic flow.
- Maximum contraflow evacuation planning problems on multi-network
- Evacuation planning by earliest arrival contraflow
- Budget-constrained minimum cost flows
- Bottleneck capacity expansion problems with general budget constraints
- Efficient contraflow algorithms for quickest evacuation planning
- On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
- One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- Multicommodity flows over time: Efficient algorithms and complexity
- Continuous dynamic contraflow approach for evacuation planning
- Faster algorithms for the quickest transshipment problem
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
- Efficient algorithms for abstract flow with partial switching
- Minimum cost dynamic flows: the series-parallel case
- On the computation of fast data transmissions in networks with capacities and delays
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Continuous time dynamic contraflow models and algorithms
- Algorithms for the quickest time distribution of dynamic stochastic-flow networks
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- Cancel-and-tighten algorithm for quickest flow problems
- The quickest flow problem
- DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
- Abstract network flow with intermediate storage for evacuation planning
- A critical survey on the network optimization algorithms for evacuation planning problems
- Time minimizing flows in directed networks
- Distributed Computing with the Cloud
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
- Quickest Flows Over Time
- Traffic Networks and Flows over Time
- The inverse-parametric knapsack problem
- Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\)
- An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity
- A survey on models and algorithms for discrete evacuation planning network problems
- A heuristic algorithm for the earliest arrival flow with multiple sources
- Distributed computing with the Cloud
- Evacuation modeling: a case study on linear and nonlinear network flow models
- On solving maximum and quickest interval-valued flows over time
- Optimization with additional variables and constraints
- A note on the quickest minimum cost transshipment problem
- A tight bound on the speed-up through storage for quickest multi-commodity flows
- 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
- Universally maximum flow with piecewise-constant capacities
- scientific article; zbMATH DE number 1418034 (Why is no real title available?)
- Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach
- A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
This page was built for publication: The quickest flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031968)
