Efficient algorithms for path problems with general cost criteria

DOI10.1007/3-540-54233-7_144MaRDI QIDQ4036574zbMATH OpenFDO

Authors Thomas Lengauer, D. Theune

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54233-7_144

zbMATH Keywords

efficient algorithmsgeneral cost criteriapath algorithmspath problemssearch methods

Mathematics Subject Classification ID

Paths and cycles (05C38) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 792650
• Routing with nonlinear multiattribute cost functions
• Unstructured path problems and the making of semirings
• On a multicriteria shortest path problem
• Shortest path algorithms for functional environments

Cited in

(8)

• Shortest path algorithms for functional environments
• Dijkstra, Floyd and Warshall meet Kleene
• Qualitative investigation of path problems
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• Algorithms and Computation
• An algorithm to determine a path with minimal cost/capacity ratio
• ECO method and hill-free generalized Motzkin paths
• Multi-objective and multi-constrained non-additive shortest path problems

This page was built for publication: Efficient algorithms for path problems with general cost criteria

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