Inverse quickest path problem on networks under weighted l_ norm
From MaRDI portal
Publication:7411487
Cites work
- A comprehensive survey on the quickest path problem
- A linear time algorithm for inverse obnoxious center location problems on networks
- A note on two problems in connexion with graphs
- An algorithm for the quickest path problem
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- Inverse 1-median problem on block graphs with variable vertex weights
- Inverse combinatorial optimization problems
- Inverse quickest center location problem on a tree
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
- Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
- Reverse 1-centre problem on trees under convex piecewise-linear cost function
- Shortest path methods: A unifying approach
- Solving the absolute 1-center problem in the quickest path case
- The absolute quickest 1-center problem on a cycle and its reverse problem
- The complexity analysis of the inverse center location problem
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- The inverse 1-maxian problem with edge length modification
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
- The quickest path problem
- The quickest root-leaf interdiction problem on tree networks
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
This page was built for publication: Inverse quickest path problem on networks under weighted \(l_{\infty}\) norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411487)