A two-criterion lexicographic algorithm for finding all shortest paths in networks

DOI10.1007/s10559-014-9666-9zbMath1308.90192OpenAlexW2080217460MaRDI QIDQ2263347

V. A. Vasyanin

Publication date: 18 March 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-014-9666-9

zbMATH Keywords

algorithmcomputational complexitymulticriteria problem of finding shortest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Optimization algorithms for packing of small-lot correspondence in communication networks

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• On a routing problem
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems

This page was built for publication: A two-criterion lexicographic algorithm for finding all shortest paths in networks