Pages that link to "Item:Q2375952"
From MaRDI portal
The following pages link to Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952):
Displaying 10 items.
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
- Relaxed voting and competitive location under monotonous gain functions on trees (Q968153) (← links)
- On locating new facilities in a competitive environment (Q1171986) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- The nestedness property of location problems on the line (Q1667399) (← links)
- A competitive facility location problem on a tree network with stochastic weights. (Q1811144) (← links)
- Traveling salesmen in the presence of competition (Q1884998) (← links)
- (Q3763866) (← links)
- On fixed-parameter solvability of the minimax path location problem (Q6063573) (← links)
