scientific article; zbMATH DE number 176744

MaRDI QIDQ4036574zbMATHFDO

Authors Thomas Lengauer, D. Theune

Publication date 18 May 1993

zbMATH Keywords

efficient algorithmssearch methodspath problemspath algorithmsgeneral cost criteria

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 792650
• Routing with nonlinear multiattribute cost functions
• scientific article; zbMATH DE number 177548
• On a multicriteria shortest path problem
• Shortest path algorithms for functional environments

Cited in

(8)

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

This page was built for publication:

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