Pages that link to "Item:Q970194"

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

Displaying 50 items.

• GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
• EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
• Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems (Q2056575) (← links)
• A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data (Q2070120) (← links)
• Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor (Q2076863) (← links)
• A maximum-margin multisphere approach for binary multiple instance learning (Q2077935) (← links)
• A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows (Q2083929) (← 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)
• Nature inspired meta heuristic algorithms for optimization problems (Q2118406) (← links)
• Global sensing search for nonlinear global optimization (Q2124800) (← links)
• A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods (Q2147112) (← links)
• The hybrid electric vehicle-traveling salesman problem with time windows (Q2178092) (← links)
• Recent advances in selection hyper-heuristics (Q2183846) (← links)
• Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches (Q2184044) (← links)
• A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
• An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem (Q2233517) (← links)
• Introduction of an underground waste container system-model and solution approaches (Q2239914) (← links)
• A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems (Q2253990) (← links)
• A new local search for continuous location problems (Q2255938) (← links)
• A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints (Q2275601) (← links)
• A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems (Q2275813) (← links)
• Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion (Q2287157) (← links)
• A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing (Q2301940) (← links)
• The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics (Q2327442) (← links)
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem (Q2327679) (← links)
• Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
• Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm (Q2375528) (← links)
• A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
• Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
• Variable neighborhood search for stochastic linear programming problem with quantile criterion (Q2423821) (← links)
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
• A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit (Q2630092) (← links)
• VNS solutions for the critical node problem (Q2631225) (← links)
• A generalized variable neighborhood search for combinatorial optimization problems (Q2631228) (← links)
• General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain (Q2631230) (← links)
• Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232) (← links)
• VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems (Q2631235) (← links)
• A variable neighborhood descent approach for the two-dimensional bin packing problem (Q2631240) (← links)
• Assigning surgery cases to operating rooms: a VNS approach for leveling ward beds occupancies (Q2631251) (← links)
• A hybrid variable neighborhood search algorithm for targeted offers in direct marketing (Q2631264) (← links)
• Clustering cities based on their development dynamics and variable neigborhood search (Q2631267) (← links)
• VNS variants for the Max-Mean dispersion problem (Q2631281) (← links)
• A variable neighborhood search for solving the multi-vehicle covering tour problem (Q2631288) (← links)
• Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)