Pages that link to "Item:Q297369"
From MaRDI portal
The following pages link to Minmax regret 1-facility location on uncertain path networks (Q297369):
Displayed 11 items.
- Minimax regret 1-sink location problem with accessibility in dynamic general networks (Q322462) (← links)
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- Multiple sink location problem in path networks with a combinational objective (Q828700) (← links)
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
- A note on computing the center of uncertain data on the real line (Q1790197) (← links)
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
- The two-center problem of uncertain points on a real line (Q2687919) (← links)
- Computing the Center of Uncertain Points on Tree Networks (Q3449857) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)