Pages that link to "Item:Q887199"

The following pages link to Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199):

Displaying 12 items.

• New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
• A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
• The planar multifacility collection depots location problem (Q1628125) (← links)
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
• A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
• \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases (Q2572249) (← links)
• Generating good starting solutions for the \(p\)-median problem in the plane (Q2840779) (← links)
• Variable neighborhood search for the p-median (Q4228784) (← links)
• Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← 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)