Pages that link to "Item:Q1584821"

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

Displaying 50 items.

• Learning to sparsify travelling salesman problem instances (Q2117244) (← links)
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
• A fresh look at the traveling salesman problem with a center (Q2147016) (← links)
• An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
• Matheuristic algorithms for the parallel drone scheduling traveling salesman problem (Q2158611) (← links)
• Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2159525) (← links)
• Efficient optimization of the Held-Karp lower bound (Q2165584) (← links)
• Improving the robustness of EPS to solve the TSP (Q2170194) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
• An approximation algorithm for graph partitioning via deterministic annealing neural network (Q2185605) (← links)
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems (Q2241908) (← links)
• A linearithmic heuristic for the travelling salesman problem (Q2242243) (← links)
• A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
• An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
• Theoretical insights into the augmented-neural-network approach for combinatorial optimization (Q2271837) (← links)
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
• Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
• A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
• Dynamic traveling salesman problem with stochastic release dates (Q2327624) (← links)
• An efficient evolutionary algorithm for the ring star problem (Q2356203) (← links)
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
• Genetic operators for combinatorial optimization in TSP and microarray gene ordering (Q2383954) (← links)
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
• Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing (Q2401327) (← links)
• A novel bio-inspired approach based on the behavior of mosquitoes (Q2446375) (← links)
• On estimating the distribution of optimal traveling salesman tour lengths using heuristics (Q2462111) (← links)
• Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
• Determination of the candidate arc set for the asymmetric traveling salesman problem (Q2485161) (← links)
• Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (Q2514749) (← links)
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem (Q2571201) (← links)
• A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172) (← links)
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
• Discrete heat transfer search for solving travelling salesman problem (Q2668543) (← links)
• A computational software system to design order picking warehouses (Q2668754) (← links)
• Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
• Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
• Crowdsourced humanitarian relief vehicle routing problem (Q2676364) (← links)
• Optimal TSP tour length estimation using standard deviation as a predictor (Q2676394) (← links)
• A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
• Optimal TSP tour length estimation using Sammon maps (Q2679001) (← links)
• A neural-network-based approach to the double traveling salesman problem. (Q2780866) (← links)
• The generalized covering salesman problem (Q2815466) (← links)
• Chained Lin-Kernighan for large traveling salesman problems (Q2884550) (← links)
• Comparison of tabu/2-opt heuristic and optimal tree search method for assignment problems (Q2903985) (← links)
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
• Visiting near-optimal solutions using local search algorithms (Q3298635) (← links)
• Special Frequency Quadrilaterals and an Application (Q3305469) (← links)