Pages that link to "Item:Q1197908"

The following pages link to Large-step Markov chains for the TSP incorporating local search heuristics (Q1197908):

Displaying 31 items.

• Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
• Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs (Q521579) (← links)
• Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
• A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← links)
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
• Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
• Heuristics for minimizing total weighted tardiness in flexible flow shops (Q1567299) (← links)
• A large step random walk for minimizing total weighted tardiness in a job shop (Q1579121) (← links)
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
• An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
• Embedded local search approaches for routing optimization (Q1886851) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Improving local search heuristics for some scheduling problems. I (Q1917263) (← links)
• Combining simulated annealing with local search heuristics (Q1919834) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• Solution of real-world postman problems (Q2482818) (← links)
• Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
• Vehicle Routing Problems with Inter-Tour Resource Constraints (Q3564369) (← links)
• Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem (Q4492397) (← links)
• Global strategies for augmenting the efficiency of TSP heuristics (Q5060118) (← links)
• Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
• Local search heuristics for two-stage flow shop problems with secondary criterion (Q5955475) (← links)
• Improving local search heuristics for some scheduling problems. II (Q5961605) (← links)
• On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)
• Machine learning constructives and local searches for the travelling salesman problem (Q6606630) (← links)