Pages that link to "Item:Q2028797"
From MaRDI portal
The following pages link to Covering problems with polyellipsoids: a location analysis perspective (Q2028797):
Displaying 6 items.
- The discrete ellipsoid covering problem: a discrete geometric programming approach (Q496677) (← links)
- New exact algorithms for planar maximum covering location by ellipses problems (Q2029953) (← links)
- An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
- On hub location problems in geographically flexible networks (Q6071054) (← links)
- Fairness in maximal covering location problems (Q6106589) (← links)
- Multi-type maximal covering location problems: hybridizing discrete and continuous problems (Q6167323) (← links)