A heuristic algorithm for multi-constrained shortest link-disjoint paths

MaRDI QIDQ5398826zbMATH OpenFDO

Authors Shiyun Gao, Feng Ma, Chuanxin Wu, Jianwen Chen, Mingfang Ni

Publication date 28 February 2014

zbMATH Keywords

integer programminglink-disjoint pathsmulti-constrained routingQoS routingthe optimal solutiontotally unimodular matrix

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL
• Heuristics for finding a maximum number of disjoint bounded paths
• Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths
• Improved approximation algorithms for computing k disjoint paths subject to two constraints
• A heuristic approach to hard constrained shortest path problems

Cited in

(4)

• A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization
• Operator calculus algorithms for multi-constrained paths
• AI 2005: Advances in Artificial Intelligence
• Efficient heuristics for determining node-disjoint path pairs visiting specified nodes

This page was built for publication: A heuristic algorithm for multi-constrained shortest link-disjoint paths

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