Pages that link to "Item:Q6138511"
From MaRDI portal
The following pages link to An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks (Q6138511):
Displaying 3 items.
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (Q877588) (← links)
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
- Valid inequalities for the \(k\)-color shortest path problem (Q6554645) (← links)