Pages that link to "Item:Q4887754"
From MaRDI portal
The following pages link to A single facility location problem on a tree with unreliable edges (Q4887754):
Displayed 13 items.
- Emergency facility location under random network damage: insights from the Istanbul case (Q337665) (← links)
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes (Q621840) (← links)
- Network location of a reliable center using the most reliable route policy (Q960392) (← links)
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges (Q1274933) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Multiple facility location on a network with linear reliability order of edges (Q1680498) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← 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)
- A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES (Q2905281) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges (Q5245845) (← links)
