Pages that link to "Item:Q1284596"
From MaRDI portal
The following pages link to Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596):
Displaying 12 items.
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
- The variable radius covering problem (Q1027534) (← links)
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover (Q1683144) (← links)
- Undesirable facility location with minimal covering objectives (Q1806769) (← links)
- On minquantile and maxcovering optimisation (Q1924061) (← links)
- New exact algorithms for planar maximum covering location by ellipses problems (Q2029953) (← links)
- Euclidean push--pull partial covering problems (Q2496058) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- Solving convex location problems with gauges in polynomial time (Q2708113) (← links)
- The β-reliable minimax and maximin location problems on a network with probabilistic weights (Q3057136) (← links)
- A defensive maximal covering problem on a network (Q3601204) (← links)
- Solving the 1-median problem on a network with continuous demand and demand surplus (Q6068730) (← links)
