Pages that link to "Item:Q960392"
From MaRDI portal
The following pages link to Network location of a reliable center using the most reliable route policy (Q960392):
Displaying 5 items.
- A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256) (← links)
- Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions (Q2178373) (← links)
- The approximability of multiple facility location on directed networks with random arc failures (Q2196606) (← links)
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges (Q2294142) (← links)
- An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges (Q5245845) (← links)
