Pages that link to "Item:Q1291604"
From MaRDI portal
The following pages link to The obnoxious \(p\) facility network location problem with facility interaction (Q1291604):
Displaying 13 items.
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study (Q832797) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- Location of a facility minimizing nuisance to or from a planar network (Q947950) (← links)
- The obnoxious \(p\) facility network location problem with facility interaction (Q1291604) (← links)
- The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← links)
- A facility location model for air pollution detection (Q1720454) (← links)
- Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives (Q1872011) (← links)
- A general model for the undesirable single facility location problem (Q2466592) (← links)
- Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
- Locating an obnoxious facility on a euclidean network to minimize neighborhood damage (Q4291480) (← links)
- Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)
