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

From MaRDI portal

Revision as of 20:55, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5281823

Jump to:navigation, search

DOI10.1109/TAC.2006.872827zbMath1366.90200MaRDI QIDQ5281823

Zhanfeng Jia, Pravin P. 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)

Related Items (2)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5281823&oldid=19929083"