Pages that link to "Item:Q2029953"
From MaRDI portal
The following pages link to New exact algorithms for planar maximum covering location by ellipses problems (Q2029953):
Displaying 8 items.
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- Covering with ellipses (Q1889588) (← links)
- Covering problems with polyellipsoids: a location analysis perspective (Q2028797) (← links)
- An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
- Lattice coverage of cuboid with minimum number of hemispheres (Q2103797) (← links)
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems (Q2253403) (← links)
- Multi-type maximal covering location problems: hybridizing discrete and continuous problems (Q6167323) (← links)
- Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)