Pages that link to "Item:Q5420849"

The following pages link to An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows (Q5420849):

Displaying 21 items.

• Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
• Scheduled penalty variable neighborhood search (Q337204) (← links)
• Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
• Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
• New heuristic for harmonic means clustering (Q887198) (← links)
• A general variable neighborhood search for the swap-body vehicle routing problem (Q1652113) (← links)
• A general variable neighborhood search variants for the travelling salesman problem with draft limits (Q1677289) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• Solving the traveling repairman problem with profits: a novel variable neighborhood search approach (Q1999008) (← links)
• An efficient heuristic for a hub location routing problem (Q2070128) (← links)
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
• A new local search for continuous location problems (Q2255938) (← links)
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
• Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
• The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory (Q2629705) (← links)
• Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
• A heuristic hybrid framework for vector job scheduling (Q4987672) (← links)
• Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)
• Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic (Q6088236) (← links)
• A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)