On modelling and solving the shortest path problem with evidential weights
From MaRDI portal
Publication:6160930
DOI10.1007/978-3-031-17801-6_14zbMath1522.90242MaRDI QIDQ6160930
Éric Lefèvre, Tuan-Anh Vu, Sohaib Afifi, Frédéric Pichon
Publication date: 2 June 2023
Published in: Belief Functions: Theory and Applications (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Approximately counting approximately-shortest paths in directed acyclic graphs
- On the robust shortest path problem.
- The capacitated vehicle routing problem with evidential demands
- An exact algorithm for the robust shortest path problem with interval data
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- The vehicle routing problem with time windows and evidential service and travel times: a recourse model
- Improving and benchmarking of algorithms for \(\Gamma \)-maximin, \( \Gamma \)-maximax and interval dominance
- Decision-making with belief functions: a review
- An exact method for the biobjective shortest path problem for large-scale road networks
- Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
This page was built for publication: On modelling and solving the shortest path problem with evidential weights
