Constrained shortest link-disjoint paths selection: a network programming based approach

DOI10.1109/TCSI.2006.869907MaRDI QIDQ4590493zbMATH OpenFDO

Authors Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue

Publication date 20 November 2017

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCSI.2006.869907

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited in

(5)

• An evolutionary programming algorithm for finding constrained optimal disjoint paths for multihop communication networks
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
• A constraint programming approach to the additional relay placement problem in wireless sensor networks
• CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL

This page was built for publication: Constrained shortest link-disjoint paths selection: a network programming based approach

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