Pages that link to "Item:Q2146374"
From MaRDI portal
The following pages link to An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374):
Displaying 3 items.
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (Q877588) (← links)
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs (Q975758) (← links)
- An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks (Q6138511) (← links)