Pages that link to "Item:Q1850991"

The following pages link to The parallel variable neighborhood search for the \(p\)-median problem (Q1850991):

Displaying 34 items.

• Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
• Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
• An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system (Q781099) (← links)
• The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
• Computational study of large-scale \(p\)-median problems (Q868446) (← links)
• A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Vehicle dispatching algorithms for container transshipment hubs (Q989625) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• A revised variable neighborhood search for the discrete ordered median problem (Q1634286) (← links)
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352) (← links)
• A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• A facility location model for air pollution detection (Q1720454) (← links)
• Variable neighborhood decomposition search (Q1850963) (← links)
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
• Near-optimal large-scale k-medoids clustering (Q2054038) (← links)
• A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
• Neighborhood structures for the container loading problem: a VNS implementation (Q2267814) (← links)
• A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm (Q2375528) (← links)
• An approach for solving competitive location problems with variable demand using multicore systems (Q2448138) (← links)
• The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory (Q2629705) (← links)
• Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232) (← links)
• MPI parallelization of variable neighborhood search (Q2840781) (← links)
• Parallel Variable Neighborhood Search (Q3424832) (← links)
• Variable neighborhood search for the p-median (Q4228784) (← links)
• (Q4422160) (← links)
• A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location (Q4995091) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• Parallel variable neighborhood search for the min–max order batching problem (Q5278230) (← 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 variable neighborhood search for the median location problem with interconnected facilities (Q6609699) (← links)