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

zbMATH Open1164.94019MaRDI QIDQ3599569FDOQ3599569

Authors: S. V. Chernyshev 

Publication date: 4 February 2009

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

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)

Cited In (5)

• Application of the direct generalisation of scalar algorithms in vector optimisation on graphs
• Title not available (Why is that?)
• Minimal paths on ordered graphs
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• The interactive analysis of the multicriteria shortest path problem by the reference point method.

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)