Pages that link to "Item:Q1302597"

The following pages link to Exponential neighbourhood local search for the traveling salesman problem (Q1302597):

Displaying 18 items.

• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
• A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
• Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
• Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
• An exponential (matching based) neighborhood for the vehicle routing problem (Q2427439) (← links)
• Further extension of the TSP assign neighborhood (Q2491321) (← links)
• A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
• The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
• Local search with an exponential neighborhood for the servers load balancing problem (Q5264767) (← links)
• Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← 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)
• Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
• TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)
• Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)