Pages that link to "Item:Q2708039"
From MaRDI portal
The following pages link to Obnoxious facility location: complete service with minimal harm (Q2708039):
Displaying 11 items.
- Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
- Packing two disks into a polygonal environment. (Q878013) (← links)
- Packing two disks in a polygon (Q1614067) (← links)
- Improved algorithms for placing undesirable facilities (Q1941958) (← links)
- Dispersing obnoxious facilities on a graph (Q2032349) (← links)
- New variations of the maximum coverage facility location problem (Q2253454) (← links)
- Locating a semi-obnoxious covering facility with repelling polygonal regions (Q2444554) (← links)
- Locating an obnoxious plane (Q2496077) (← links)
- Computing obnoxious 1-corner polygonal chains (Q2571197) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)