Pages that link to "Item:Q1667394"
From MaRDI portal
The following pages link to Extensive facility location problems on networks: an updated review (Q1667394):
Displaying 13 items.
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
- Inverse group 1-median problem on trees (Q2031325) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm (Q2192028) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- On location-allocation problems for dimensional facilities (Q2317850) (← links)
- A linear time algorithm for balance vertices on trees (Q2419583) (← links)
- A directional approach to gradual cover (Q2421326) (← links)
- A linear time algorithm for connected \(p\)-centdian problem on block graphs (Q2672632) (← links)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
- The extensive 1-median problem with radius on networks (Q6091088) (← links)
- Mathematical optimization models for reallocating and sharing health equipment in pandemic situations (Q6113556) (← links)
