Min‐Max quickest path problems

DOI10.1002/net.21473zbMath1269.68072OpenAlexW2028122282MaRDI QIDQ5326774

Stefan Ruzika, Markus Thiemann

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2249

zbMATH Keywords

optimizationpolynomial algorithmsFPTASmultiple objective optimizationquickest path problemrobust network flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Multi-objective and goal programming (90C29) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (6)

Fast and fine quickest path algorithm ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ Substitution secant/finite difference method to large sparse minimax problems ⋮ Group update method for sparse minimax problems ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ Optimal flow and capacity allocation in multiple joint quickest paths of directed networks

Cites Work

• Unnamed Item
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
• Internet packet routing: application of a \(K\)-quickest path algorithm
• The quickest path problem
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Finding the \(k\) quickest simple paths in a network
• An algorithm for the quickest path problem
• On the robust shortest path problem.
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• The all-pairs quickest path problem
• A comprehensive survey on the quickest path problem

This page was built for publication: Min‐Max quickest path problems