Pages that link to "Item:Q6066720"

The following pages link to Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720):

Displaying 23 items.

• Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
• Variable neighborhood programming for symbolic regression (Q2070125) (← links)
• An efficient heuristic for a hub location routing problem (Q2070128) (← links)
• A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
• Less is more approach in optimization: a road to artificial intelligence (Q2070138) (← links)
• Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
• A variable neighborhood search algorithm for an integrated physician planning and scheduling problem (Q2676356) (← links)
• Variable neighborhood search for the p-median (Q4228784) (← links)
• Variable Neighborhood Programming as a Tool of Machine Learning (Q5153506) (← links)
• Fat-tailed distributions for continuous variable neighborhood search (Q6063519) (← links)
• A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
• The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem (Q6070875) (← links)
• A variable neighborhood search for flying sidekick traveling salesman problem (Q6088243) (← links)
• A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)
• An efficient implementation of a VNS heuristic for the weighted fair sequences problem (Q6146639) (← links)
• The obnoxious competitive facility location model (Q6146884) (← links)
• Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak (Q6168128) (← links)
• Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm (Q6551161) (← 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)