Optimal flow and capacity allocation in multiple joint quickest paths of directed networks

DOI10.1016/j.cor.2022.106053OpenAlexW4307331532MaRDI QIDQ2108154

Yanyan Li

Publication date: 19 December 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106053

zbMATH Keywords

capacitylinear fractional programmingminimum transmission timemultiple joint quickest pathsrouting/scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Fast and fine quickest path algorithm
• Algorithms for the quickest path problem and the reliable quickest path problem
• Multi-terminal maximum flows in node-capacitated networks
• An algorithm for finding the \(k\) quickest paths in a network
• On the quickest path problem
• A label-setting algorithm for finding a quickest path
• The all-pairs quickest path problem
• Reliable and Restricted Quickest Path Problems
• Maximum Throughput Network Routing Subject to Fair Flow Allocation
• The maximum concurrent flow problem
• A new approach to the maximum-flow problem
• Heuristic Methods for Delay Constrained Least Cost Routing Using<tex>$k$</tex>-Shortest-Paths
• Min‐Max quickest path problems
• Programming with linear fractional functionals
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Optimal flow and capacity allocation in multiple joint quickest paths of directed networks