Pages that link to "Item:Q2489903"

The following pages link to First vs. best improvement: an empirical study (Q2489903):

Displaying 27 items.

• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
• A local search heuristic for the \((r| p)\)-centroid problem in the plane (Q337239) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• A VNS approach to multi-location inventory redistribution with vehicle routing (Q1652123) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
• Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
• Less is more: general variable neighborhood search for the capacitated modular hub location problem (Q2002852) (← links)
• Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
• Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem (Q2448149) (← links)
• In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (Q5278229) (← links)
• Constructive-destructive heuristics for the safe set problem (Q6047845) (← links)
• Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
• The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem (Q6070875) (← links)
• Partial neighborhood local searches (Q6082175) (← links)
• An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924) (← links)
• Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
• Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
• A new fuzzy model for multi-criteria project portfolio selection based on modified Kerre's inequality (Q6191692) (← links)