Heuristic Methods for Delay Constrained Least Cost Routing Using<tex>k</tex>-Shortest-Paths

DOI10.1109/TAC.2006.872827MaRDI QIDQ5281823zbMATH OpenFDO

Authors Zhanfeng Jia, Pravin Varaiya

Publication date 27 July 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited in

(2)

• Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
• Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem

This page was built for publication: Heuristic Methods for Delay Constrained Least Cost Routing Using<tex>$k$</tex>-Shortest-Paths

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