Pages that link to "Item:Q2070130"

The following pages link to A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130):

Displaying 11 items.

• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
• A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
• A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
• Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
• Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
• The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
• (Q4690461) (← links)
• Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
• A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
• Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
• A matheuristic for locating obnoxious facilities (Q6568397) (← links)