The quickest flow problem
From MaRDI portal
Publication:4031968
DOI10.1007/BF01415527zbMath0780.90031OpenAlexW1968268863MaRDI QIDQ4031968
Karin Dlaska, Rainer E. Burkard, Bettina Klinz
Publication date: 3 May 1993
Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01415527
linear fractional programmingdirected graphpolynomial algorithmsmaximum dynamic flow problemquickest flow problem
Abstract computational complexity for mathematical programming problems (90C60) Fractional programming (90C32) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items (39)
Evacuation planning by earliest arrival contraflow ⋮ Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) ⋮ Budget-constrained minimum cost flows ⋮ Efficient contraflow algorithms for quickest evacuation planning ⋮ 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 ⋮ Multicommodity flows over time: Efficient algorithms and complexity ⋮ DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Evacuation modeling: a case study on linear and nonlinear network flow models ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning ⋮ Algorithms for the quickest time distribution of dynamic stochastic-flow networks ⋮ The inverse-parametric knapsack problem ⋮ Minimum cost dynamic flows: The series-parallel case ⋮ The quickest flow problem ⋮ Distributed computing with the Cloud ⋮ Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study ⋮ The Maximum Energy-Constrained Dynamic Flow Problem ⋮ Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach ⋮ Unnamed Item ⋮ An Introduction to Network Flows over Time ⋮ Unnamed Item ⋮ On solving maximum and quickest interval-valued flows over time ⋮ Earliest arrival flows in networks with multiple sinks ⋮ Continuous time dynamic contraflow models and algorithms ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ Complexity analysis for maximum flow problems with arc reversals ⋮ Universally maximum flow with piecewise-constant capacities ⋮ Bottleneck Capacity Expansion Problems with General Budget Constraints ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Optimization with additional variables and constraints ⋮ A tight bound on the speed-up through storage for quickest multi-commodity flows ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Traffic Networks and Flows over Time ⋮ One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs ⋮ Efficient algorithms for abstract flow with partial switching ⋮ Abstract network flow with intermediate storage for evacuation planning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The quickest path problem
- A survey of dynamic network flows
- Parametric shortest path algorithms with an application to cyclic staffing
- Algorithms for the quickest path problem and the enumeration of quickest paths
- New scaling algorithms for the assignment and minimum mean cycle problems
- A new saling algorithm for the maximum mean cut problem
- Complexity of some parametric integer and network programming problems
- An efficient implementation of the network simplex method
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Dual Algorithms for Pure Network Problems
- Combinatorial Optimization with Rational Objective Functions
- Primal transportation and transshipment algorithms
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- The quickest flow problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Maximal, Lexicographic, and Dynamic Network Flows
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- Parametric approaches to fractional programs
- A bad network problem for the simplex method and other minimum cost flow algorithms
- Faster parametric shortest path and minimum‐balance algorithms
- Fractional programming
This page was built for publication: The quickest flow problem
