Pages that link to "Item:Q6088247"
From MaRDI portal
The following pages link to A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247):
Displaying 14 items.
- Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study (Q832797) (← links)
- A revised variable neighborhood search for the discrete ordered median problem (Q1634286) (← links)
- Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
- An efficient variable neighborhood search for the space-free multi-row facility layout problem (Q2242375) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- Variable neighborhood search for the p-median (Q4228784) (← 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)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
- A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems (Q6561237) (← links)
- A matheuristic for locating obnoxious facilities (Q6568397) (← links)
- A variable neighborhood search for the median location problem with interconnected facilities (Q6609699) (← links)
- An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem (Q6609705) (← links)
