Pages that link to "Item:Q970194"

The following pages link to Variable neighbourhood search: methods and applications (Q970194):

Displaying 50 items.

• An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes (Q2669644) (← links)
• Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
• A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances (Q2669799) (← links)
• Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields (Q2675707) (← links)
• A variable neighborhood search algorithm for an integrated physician planning and scheduling problem (Q2676356) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey (Q2691459) (← links)
• Developments of variable neighborhood search (Q2776569) (← links)
• A parallel hybrid metaheuristic for bicluster editing (Q2811935) (← links)
• Variable neighborhood search for solving the balanced location problem (Q2840746) (← links)
• Variable neighborhood search for the strong metric dimension problem (Q2840752) (← links)
• A variable neighbourhood search approach to the cutwidth minimization problem (Q2840754) (← links)
• A variable neighborhood search for the multi-product inventory routing problem (Q2840757) (← links)
• A hybrid heuristic based on general variable neighborhood search for the single vehicle routing problem with deliveries and selective pickups (Q2840759) (← links)
• A hybrid metaheuristic based on variable neighborhood search and tabu search for the web service selection problem (Q2840766) (← links)
• VNS based heuristic for solving the unit commitment problem (Q2840767) (← links)
• Variable neighborhood search for multiple level warehouse layout problem (Q2840768) (← links)
• Packing unit spheres into a cube using VNS (Q2840774) (← links)
• Variable neighborhood search for Google machine reassignment problem (Q2840775) (← links)
• A variable neighborhood search and its application to a ring star problem generalization (Q2883580) (← links)
• An Investigation on Compound Neighborhoods for VRPTW (Q2980168) (← links)
• Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search (Q3388795) (← links)
• Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem (Q4596148) (← links)
• (Q4669253) (← links)
• A new variable neighborhood search approach for solving dynamic memory allocation problem (Q4987788) (← links)
• The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique (Q4987796) (← links)
• A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)
• Variable Neighborhood Programming as a Tool of Machine Learning (Q5153506) (← links)
• An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q5172564) (← links)
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (Q5278229) (← links)
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem (Q5278232) (← links)
• Arbitrary-norm hyperplane separation by variable neighbourhood search (Q5432694) (← links)
• Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search (Q5863640) (← links)
• The zone-based dynamic facility layout problem (Q5884346) (← links)
• A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect (Q6043106) (← links)
• Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II (Q6047920) (← links)
• A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
• A stochastic approach for planning airport ground support resources (Q6060658) (← links)
• A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands (Q6060670) (← links)
• A general VNS for the multi-depot open vehicle routing problem with time windows (Q6063504) (← links)
• General variable neighborhood search approach to group Steiner tree problem (Q6063507) (← links)
• General variable neighborhood search for the parallel machine scheduling problem with two common servers (Q6063516) (← links)
• Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture (Q6066680) (← links)
• Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
• The intermittent travelling salesman problem (Q6066722) (← links)
• Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls (Q6066723) (← links)
• Multiple traveling salesperson problem with drones: general variable neighborhood search approach (Q6068716) (← links)
• The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem (Q6070875) (← links)
• Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands (Q6070975) (← links)
• Using horizontal cooperation concepts in integrated routing and facility‐location decisions (Q6070979) (← links)