The following pages link to (Q4825540):
Displaying 10 items.
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
- Location of an undesirable facility in a polygonal region with forbidden zones (Q1296367) (← links)
- Discrete facility location and routing of obnoxious activities. (Q1417557) (← links)
- Dispersing obnoxious facilities on a graph (Q2032349) (← links)
- Locating an obnoxious facility on a euclidean network to minimize neighborhood damage (Q4291480) (← links)
- Dispersing Obnoxious Facilities on a Graph (Q5090483) (← links)
- Dispersing facilities on planar segment and circle amidst repulsion (Q6112004) (← links)
- Obnoxious facility location in multiple dimensional space (Q6113555) (← links)
