Variants of shortest path problems

MaRDI QIDQ2865872zbMATH OpenFDO

Authors Lara Turner

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/18312

zbMATH Keywords

shortest path problemresource constrained shortest path problemuniversal objective functionstrongly polynomial-time algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Signed and weighted graphs (05C22) Paths and cycles (05C38)

Recommendations

• On universal shortest paths
• scientific article; zbMATH DE number 1114039
• Time-varying shortest path problems with constraints
• The tricriterion shortest path problem with at least two bottleneck objective functions
• On a multicriteria shortest path problem

Cited in

(12)

• On the generality of the greedy algorithm for solving matroid base problems
• An algebraic framework for multi-objective and robust variants of path problems
• Shortest path with acceleration constraints: complexity and approximation algorithms
• Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
• Balanced Optimization with Vector Costs
• A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
• Robust balanced optimization
• On universal shortest paths
• A class of exponential neighbourhoods for the quadratic travelling salesman problem
• Shortest paths with shortest detours. A biobjective routing problem
• A branch-and-cut algorithm for the balanced traveling salesman problem
• The \(k\)-centrum shortest path problem

This page was built for publication: Variants of shortest path problems

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