Pages that link to "Item:Q1584821"

The following pages link to An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821):

Displaying 46 items.

• Heuristiques pour le Problème du Vendeur<i>m</i>-Péripatétique (Q3621973) (← links)
• Mathematical foundation of quantum annealing (Q3624670) (← links)
• Continuous reformulations and heuristics for the Euclidean travelling salesperson problem (Q3643507) (← links)
• Optimization of logistics services in hospitals (Q4608286) (← links)
• A construction for directed in-out subgraphs of optimal size (Q4622626) (← links)
• The snake for visualizing and for counting clusters in multivariate data (Q4969720) (← links)
• A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
• Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles (Q5006572) (← links)
• Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples (Q5009933) (← links)
• (Q5020990) (← links)
• Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks (Q5026663) (← links)
• A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)
• Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
• 2-Opt Moves and Flips for Area-optimal Polygonizations (Q5102068) (← links)
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
• Cayley graphs of order kp are hamiltonian for k &lt; 48 (Q5121556) (← links)
• Dynamical Systems Theory and Algorithms for NP-hard Problems (Q5131680) (← links)
• Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← links)
• A new selection operator for genetic algorithms that balances between premature convergence and population diversity (Q5147651) (← links)
• (Q5150579) (← links)
• A Sensitive Metaheuristic for Solving a Large Optimization Problem (Q5448681) (← links)
• Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
• Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
• On line Routing per Mobile Phone A Case on Subsequent Deliveries of Newspapers (Q5850924) (← links)
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
• Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
• Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
• The rendezvous vehicle routing problem (Q6057627) (← links)
• Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers (Q6065897) (← links)
• Exact models for the flying sidekick traveling salesman problem (Q6071072) (← links)
• Effective metaheuristics for the latency location routing problem (Q6080614) (← links)
• Comparison of four mechanisms for request exchange in collaborative transportation (Q6082287) (← links)
• Heuristic sequencing methods for time optimal tracking of nested, open and closed paths (Q6084144) (← links)
• A branch‐and‐dive heuristic for single vehicle snow removal (Q6092642) (← links)
• A reinforced hybrid genetic algorithm for the traveling salesman problem (Q6106563) (← links)
• An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
• An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem (Q6142940) (← links)
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)
• Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
• The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)
• Solving large-scale routing optimization problems with networks and only networks (Q6204267) (← links)
• Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization (Q6495409) (← links)
• Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs (Q6551136) (← links)
• A real-life study on the value of integrated optimization in order picking operations under dynamic order arrivals (Q6599072) (← links)