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.

• LKH (Q16903) (← links)
• The salesman and the tree: the importance of search in CP (Q272000) (← links)
• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• A distribution-free TSP tour length estimation model for random graphs (Q319156) (← links)
• The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
• Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem (Q319379) (← links)
• The multi-compartment vehicle routing problem with flexible compartment sizes (Q319854) (← links)
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
• MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
• On the recoverable robust traveling salesman problem (Q331985) (← links)
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
• A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420) (← links)
• Ambulance routing for disaster response with patient groups (Q337463) (← links)
• A simulated annealing heuristic for the open location-routing problem (Q337651) (← links)
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
• Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
• Social structure optimization in team formation (Q342472) (← links)
• Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
• Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
• Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
• Improved filtering for weighted circuit constraints (Q487627) (← links)
• Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
• On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
• A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
• A parallel quadratic programming method for dynamic optimization problems (Q499159) (← links)
• Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
• A \(k\)-level data structure for large-scale traveling salesman problems (Q512957) (← links)
• Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
• Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
• Symmetric weight constrained traveling salesman problem: Local search (Q535615) (← links)
• A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
• A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174) (← links)
• Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
• A modified Lin--Kernighan traveling-salesman heuristic (Q688925) (← links)
• Sequencing and scheduling for filling lines in dairy production (Q691446) (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
• Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
• Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• Multiprogramming genetic algorithm for optimization problems with permutation property (Q870194) (← links)
• Synchronized routing of seasonal products through a production/distribution network (Q926350) (← links)
• The petrol station replenishment problem with time windows (Q955625) (← links)
• Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)