Pages that link to "Item:Q1707084"

The following pages link to Variable neighborhood search: basics and variants (Q1707084):

Displaying 50 items.

• Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
• Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (Q1730628) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• Solving the traveling repairman problem with profits: a novel variable neighborhood search approach (Q1999008) (← links)
• Less is more: general variable neighborhood search for the capacitated modular hub location problem (Q2002852) (← links)
• A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations (Q2003572) (← links)
• Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
• On solving the order processing in picking workstations (Q2070114) (← links)
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
• A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
• Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem (Q2070127) (← 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)
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (Q2070134) (← links)
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
• A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102) (← links)
• A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
• Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
• Portfolio decision analysis with a generalized balance approach (Q2146968) (← links)
• Modelling and solving the milk collection problem with realistic constraints (Q2147008) (← links)
• Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem (Q2147064) (← links)
• A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods (Q2147112) (← links)
• Data-driven optimization and statistical modeling to improve meter reading for utility companies (Q2147136) (← links)
• Algorithm selection for the team orienteering problem (Q2163778) (← links)
• Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
• Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
• Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion (Q2287157) (← links)
• Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
• Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection (Q2331437) (← links)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
• Learning variable neighborhood search for a scheduling problem with time windows and rejections (Q2414479) (← links)
• Visual attractiveness in vehicle routing via bi-objective optimization (Q2669616) (← links)
• Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem (Q2669708) (← links)
• Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
• A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem (Q2675709) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
• Less is more: Simplified Nelder-Mead method for large unconstrained optimization (Q4987781) (← links)
• A hybrid algorithm for the drilling rig routing problem (Q5100126) (← links)
• Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations (Q5138256) (← links)
• Merging Variables: One Technique of Search in Pseudo-Boolean Optimization (Q5214427) (← links)
• A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale (Q6047905) (← links)
• Adaptive variable neighbourhood search approach for time-dependent joint location and dispatching problem in a multi-tier ambulance system (Q6047915) (← links)
• A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping (Q6063502) (← links)
• General variable neighborhood search for the minimum stretch spanning tree problem (Q6063503) (← links)
• A general VNS for the multi-depot open vehicle routing problem with time windows (Q6063504) (← links)