Pages that link to "Item:Q2776569"

The following pages link to Developments of variable neighborhood search (Q2776569):

Displaying 50 items.

• Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
• A nonmonotone GRASP (Q340011) (← links)
• Constraint-based very large-scale neighborhood search (Q434452) (← links)
• General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
• A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
• On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
• The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
• Learning multicriteria fuzzy classification method PROAFTN from data (Q868128) (← links)
• Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
• Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks (Q932187) (← links)
• Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
• General variable neighborhood search for the continuous optimization (Q932193) (← links)
• A modified VNS metaheuristic for max-bisection problems (Q939544) (← links)
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
• Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem (Q953320) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
• Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Variable neighborhood search (Q1374041) (← links)
• A variable neighborhood search for graph coloring. (Q1410622) (← links)
• Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. (Q1410623) (← links)
• A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints (Q1677303) (← links)
• A general framework for nested variable neighborhood search (Q1687670) (← links)
• Exploring variable neighborhood search for automatic algorithm configuration (Q1687671) (← links)
• New VNP for automatic programming (Q1687679) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
• Variable neighborhood decomposition search (Q1850963) (← links)
• The parallel variable neighborhood search for the \(p\)-median problem (Q1850991) (← links)
• Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• Preface to the special issue on variable neighborhood search (Q2070112) (← links)
• Across neighborhood search algorithm: a comprehensive analysis (Q2195424) (← links)
• A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
• A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
• Variable neighborhood search for graphical model energy minimization (Q2287189) (← links)
• A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule (Q2464208) (← links)
• Variable neighborhood search and local branching (Q2489139) (← links)
• Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
• Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
• Data-mining-driven neighborhood search (Q2815441) (← links)
• Variable neighborhood search for the strong metric dimension problem (Q2840752) (← links)
• An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems (Q2840753) (← links)
• Variable neighborhood descent heuristic for covering design problem (Q2840773) (← links)
• Estimating differential evolution crossover parameter with VNS approach for continuous global optimization (Q2840783) (← links)
• Genetic Neighborhood Search (Q4739402) (← links)
• Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)