Pages that link to "Item:Q733537"
From MaRDI portal
The following pages link to Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537):
Displaying 11 items.
- Location of an undesirable facility in a polygonal region with forbidden zones (Q1296367) (← links)
- Computing an obnoxious anchored segment. (Q1413920) (← links)
- Discrete facility location and routing of obnoxious activities. (Q1417557) (← links)
- Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
- Improved algorithms for placing undesirable facilities (Q1941958) (← links)
- Dispersing obnoxious facilities on a graph (Q2032349) (← links)
- Locating an obnoxious facility on a euclidean network to minimize neighborhood damage (Q4291480) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- Dispersing Obnoxious Facilities on a Graph (Q5090483) (← links)
- OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS (Q5888151) (← links)
- Dispersing facilities on planar segment and circle amidst repulsion (Q6112004) (← links)