Pages that link to "Item:Q1422376"
From MaRDI portal
The following pages link to Semi-obnoxious single facility location in Euclidean space. (Q1422376):
Displaying 18 items.
- Inequity averse optimization in operational research (Q319581) (← links)
- The multicriteria big cube small cube method (Q611015) (← links)
- Solving the semi-desirable facility location problem using bi-objective particle swarm (Q856268) (← links)
- An interactive solution approach for a bi-objective semi-desirable location problem (Q960111) (← links)
- On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) (Q969512) (← links)
- Multiple criteria facility location problems: a survey (Q988401) (← links)
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
- Efficiency for continuous facility location problems with attraction and repulsion (Q1026586) (← links)
- Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
- OR models in urban service facility location: a critical review of applications and future developments (Q1728469) (← links)
- New models for the location of controversial facilities: a bilevel programming approach (Q1738822) (← links)
- A bi-objective modeling approach applied to an urban semi-desirable facility location problem (Q1927006) (← links)
- Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives (Q2253362) (← links)
- On heuristic bi-criterion methods for semi-obnoxious facility location (Q2340496) (← links)
- Locating a semi-obnoxious covering facility with repelling polygonal regions (Q2444554) (← links)
- Computing obnoxious 1-corner polygonal chains (Q2571197) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- The Location of Undesirable Facilities (Q5506725) (← links)
