The quickest path problem with batch constraints.

DOI10.1016/S0167-6377(02)00239-0zbMath1041.90004OpenAlexW2005111997MaRDI QIDQ1413916

Herminia I. Calvete, Lourdes Del-Pozo

Publication date: 17 November 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00239-0

zbMATH Keywords

Network flowsFlowrate constrained capacityQuickest pathTransmission with size limits

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (4)

Fast and fine quickest path algorithm ⋮ Algorithms for the quickest path problem and the reliable quickest path problem ⋮ The energy-constrained quickest path problem ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks

Cites Work

• The quickest path problem
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Distributed algorithms for the quickest path problem
• An algorithm for finding the \(k\) quickest paths in a network
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths

This page was built for publication: The quickest path problem with batch constraints.