Pages that link to "Item:Q2669654"
From MaRDI portal
The following pages link to Review of obnoxious facilities location problems (Q2669654):
Displaying 22 items.
- Analytical models for locating undesirable facilities (Q1118522) (← links)
- Locating an obnoxious facility (Q1195639) (← links)
- Semi-obnoxious location models: A global optimization approach (Q1291602) (← links)
- Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location (Q2128766) (← links)
- Extensions to the Weber problem (Q2147049) (← links)
- Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
- Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
- Obnoxious facility location: complete service with minimal harm (Q2708039) (← links)
- The Location of Undesirable Facilities (Q5506725) (← links)
- OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS (Q5888151) (← links)
- An efficient heuristic for the \(k\)-partitioning problem (Q6063777) (← links)
- A trajectory based heuristic for the planar \(p\)-median problem (Q6106602) (← links)
- Dispersing facilities on planar segment and circle amidst repulsion (Q6112004) (← links)
- Siting noxious facilities: efficiency and majority rule decisions (Q6112724) (← links)
- Obnoxious facility location in multiple dimensional space (Q6113555) (← links)
- The obnoxious competitive facility location model (Q6146884) (← links)
- Multiple obnoxious facility location: the case of protected areas (Q6538805) (← links)
- Minimum-width double-slabs and widest empty slabs in high dimensions (Q6547941) (← links)
- Location-pricing problem in a two-echelon supply chain: a behavioral game-theoretic approach (Q6551091) (← links)
- A matheuristic for locating obnoxious facilities (Q6568397) (← links)
- Competitive location models: a review (Q6586251) (← links)
- An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem (Q6609705) (← links)