Generalization of multicriterion problem on determination of the shortest paths in oriented graph

MaRDI QIDQ3599569zbMATH OpenFDO

Authors S. V. Chernyshev

Publication date 4 February 2009

zbMATH Keywords

algorithm correctnessgeneralization of Dejkstra algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 792650
• On a multicriteria shortest path problem
• Minimal paths on ordered graphs
• Publication:3487151
• scientific article; zbMATH DE number 4099071

Cited in

(5)

• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• Application of the direct generalisation of scalar algorithms in vector optimisation on graphs
• Minimal paths on ordered graphs
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• scientific article; zbMATH DE number 792650 (Why is no real title available?)

This page was built for publication: Generalization of multicriterion problem on determination of the shortest paths in oriented graph

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