MIN-MAX quickest path problems

DOI10.1002/NET.21473MaRDI QIDQ5326774zbMATH OpenOpenAlexFDO

Authors 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

FPTASmultiple objective optimizationoptimizationpolynomial algorithmsquickest path problemrobust network flows

Mathematics Subject Classification ID

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

Recommendations

• Reliable and restricted quickest path problems
• On solving quickest time problems in time-dependent, dynamic networks
• The quickest transshipment problem
• scientific article; zbMATH DE number 1003275
• scientific article; zbMATH DE number 910909

Cites work

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

Cited in

(14)

• The quickest path problem with interval lead times
• On solving quickest time problems in time-dependent, dynamic networks
• Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
• Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
• Fast and fine quickest path algorithm
• Quickest cluster flow problems on tree networks
• Reliable and restricted quickest path problems
• The Minimum Reload s-t Path/Trail/Walk Problems
• Substitution secant/finite difference method to large sparse minimax problems
• Group update method for sparse minimax problems
• The quickest path problem
• Graph path minimization problem
• The minimum reload \(s-t\) path, trail and walk problems

This page was built for publication: MIN-MAX quickest path problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326774)