Pages that link to "Item:Q496433"
From MaRDI portal
The following pages link to Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433):
Displaying 6 items.
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
- New approaches to the robust 1-center location problems on tree networks (Q2678831) (← links)
