Pages that link to "Item:Q390143"
From MaRDI portal
The following pages link to Improved algorithms to network \(p\)-center location problems (Q390143):
Displaying 9 items.
- Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
- Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956) (← links)
- An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
- Some new algorithms for location problems on networks (Q1291656) (← links)
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
- The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
- (Q3763866) (← links)
- The two-center problem of uncertain points on trees (Q6606211) (← links)