The quickest flow problem

DOI10.1007/BF01415527zbMATH Open0780.90031OpenAlexW1968268863MaRDI QIDQ4031968FDOQ4031968

Karin Dlaska, Rainer E. Burkard, Bettina Klinz

Publication date: 3 May 1993

Published in: 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

zbMATH Keywords

directed graphpolynomial algorithmslinear fractional programmingmaximum dynamic flow problemquickest flow problem

Mathematics Subject Classification ID

Linear programming (90C05) Fractional programming (90C32) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Title not available (Why is that?)
• Fractional programming
• New scaling algorithms for the assignment and minimum mean cycle problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial Optimization with Rational Objective Functions
• The quickest flow problem
• Title not available (Why is that?)
• Complexity of some parametric integer and network programming problems
• Note—Some Equivalent Objectives for Dynamic Network Flow Problems
• Algorithms for the quickest path problem and the enumeration of quickest paths
• The quickest path problem
• A survey of dynamic network flows
• Faster parametric shortest path and minimum‐balance algorithms
• Parametric approaches to fractional programs
• Parametric shortest path algorithms with an application to cyclic staffing
• Maximal, Lexicographic, and Dynamic Network Flows
• An efficient implementation of the network simplex method
• Dual Algorithms for Pure Network Problems
• Title not available (Why is that?)
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Title not available (Why is that?)
• Primal transportation and transshipment algorithms
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• A new saling algorithm for the maximum mean cut problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (47)

• Minimum cost dynamic flows: The series-parallel case
• The inverse-parametric knapsack problem
• Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations
• Distributed Computing with the Cloud
• An Introduction to Network Flows over Time
• Title not available (Why is that?)
• Evacuation planning by earliest arrival contraflow
• Multicommodity flows over time: Efficient algorithms and complexity
• Budget-constrained minimum cost flows
• Continuous time dynamic contraflow models and algorithms
• DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
• One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
• The quickest transshipment problem
• A heuristic algorithm for the earliest arrival flow with multiple sources
• The Maximum Energy-Constrained Dynamic Flow Problem
• Complexity analysis for maximum flow problems with arc reversals
• Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure
• Time minimizing flows in directed networks
• Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\)
• Bottleneck capacity expansion problems with general budget constraints
• Continuous dynamic contraflow approach for evacuation planning
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• Efficient contraflow algorithms for quickest evacuation planning
• Optimization with additional variables and constraints
• A tight bound on the speed-up through storage for quickest multi-commodity flows
• Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach
• 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
• Evacuation modeling: a case study on linear and nonlinear network flow models
• Universally maximum flow with piecewise-constant capacities
• On solving maximum and quickest interval-valued flows over time
• Title not available (Why is that?)
• Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study
• Earliest arrival flows in networks with multiple sinks
• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
• A survey on models and algorithms for discrete evacuation planning network problems
• Fast data transmission and maximal dynamic flow.
• Faster algorithms for the quickest transshipment problem
• Efficient algorithms for abstract flow with partial switching
• Abstract network flow with intermediate storage for evacuation planning
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
• Title not available (Why is that?)
• On the computation of fast data transmissions in networks with capacities and delays
• Traffic Networks and Flows over Time
• One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs
• The quickest flow problem
• Distributed computing with the Cloud

   Recommendations

• Faster algorithms for the quickest transshipment problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Cancel-and-tighten algorithm for quickest flow problems 👍 👎
• Fast data transmission and maximal dynamic flow. 👍 👎
• The quickest path problem 👍 👎

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)