The energy-constrained quickest path problem
From MaRDI portal
Publication:1676484
DOI10.1007/s11590-016-1073-xzbMath1381.90091OpenAlexW2517527546MaRDI QIDQ1676484
José A. Iranzo, Herminia I. Calvete, Lourdes Del-Pozo
Publication date: 9 November 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://zaguan.unizar.es/record/65229
Related Items (2)
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks
Uses Software
Cites Work
- Unnamed Item
- Fast and fine quickest path algorithm
- Algorithms for the quickest path problem and the reliable quickest path problem
- Internet packet routing: application of a \(K\)-quickest path algorithm
- The quickest path problem
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
- A comparison of solution strategies for biobjective shortest path problems
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- Finding the \(k\) quickest simple paths in a network
- An algorithm for the quickest path problem
- On the sum-max bicriterion path problem.
- The quickest path problem with batch constraints.
- A label-setting algorithm for finding a quickest path
- An algorithm for ranking quickest simple paths
- A comprehensive survey on the quickest path problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: The energy-constrained quickest path problem