Pages that link to "Item:Q322911"

The following pages link to Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911):

Displaying 12 items.

• Search tree-based approach for the \(p\)-median problem using the ant colony optimization algorithm (Q495424) (← links)
• The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← 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)
• Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
• Review of obnoxious facilities location problems (Q2669654) (← 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)
• Dispersing facilities on planar segment and circle amidst repulsion (Q6112004) (← links)
• A matheuristic for locating obnoxious facilities (Q6568397) (← links)
• An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem (Q6609705) (← links)