The energy-constrained quickest path problem

DOI10.1007/S11590-016-1073-XMaRDI QIDQ1676484zbMATH OpenOpenAlexFDO

Authors Herminia I. Calvete, José A. Iranzo, 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

zbMATH Keywords

bi-objective optimizationenergy constraintquickest path

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Recommendations

• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• The quickest path problem with batch constraints.
• Algorithms for the quickest path problem and the enumeration of quickest paths
• The quickest path problem

Cites work

• A comparison of solution strategies for biobjective shortest path problems
• A comprehensive survey on the quickest path problem
• A label-setting algorithm for finding a quickest path
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Algorithms for the quickest path problem and the reliable quickest path problem
• An algorithm for ranking quickest simple paths
• An algorithm for the quickest path problem
• Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
• Fast and fine quickest path algorithm
• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding the \(k\) quickest simple paths in a network
• scientific article; zbMATH DE number 1714716 (Why is no real title available?)
• Internet packet routing: application of a K-quickest path algorithm
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• On the sum-max bicriterion path problem.
• The quickest path problem
• The quickest path problem with batch constraints.

Cited in

(6)

• Finding optimal paths in MREP routing
• The quickest path problem with batch constraints.
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• The Maximum Energy-Constrained Dynamic Flow Problem
• Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
• The quickest path problem

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: The energy-constrained quickest path problem

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