The rough interval shortest path problem

DOI10.1007/978-3-030-85476-8_5MaRDI QIDQ2089442zbMATH OpenOpenAlexFDO

Authors Ali Moghanni, Marta M. B. Pascoal

Publication date 22 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-85476-8_5

zbMATH Keywords

labelingrough setsshortest pathefficient solutions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Solving the shortest path problem with interval arcs
• Algorithms for the minmax regret path problem with interval data
• The minmax regret robust shortest path problem in a finite multi-scenario model
• Uncertain random shortest path problem
• A branch and bound algorithm for the robust shortest path problem with interval data.

Cites work

• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• On a multicriteria shortest path problem
• Rough sets

Cited in

(5)

• An acceptability index based approach for solving shortest path problem on a network with interval weights
• An exact algorithm for the robust shortest path problem with interval data
• Solving the shortest path problem with interval arcs
• The computational complexity of the relative robust shortest path problem with interval data
• Uncertain random shortest path problem

This page was built for publication: The rough interval shortest path problem

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