Pages that link to "Item:Q1612766"

The following pages link to The traveling salesman problem and its variations (Q1612766):

Displaying 50 items.

• Route problem with constraints depending on a list of tasks (Q265955) (← links)
• On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (Q294361) (← links)
• Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
• The hybrid electric vehicle-traveling salesman problem (Q323259) (← links)
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
• Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
• Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
• A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
• The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
• Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382) (← links)
• Exponential approximation schemata for some network design problems (Q396669) (← links)
• An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
• Nonlinear resolving functions for the travelling salesman problem (Q462011) (← links)
• Modeling recreational systems using optimization techniques and information technologies (Q478052) (← links)
• A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
• Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above (Q492278) (← links)
• Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
• Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338) (← links)
• Approximate algorithms for the traveling salesman problem. II (Q499569) (← links)
• A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
• Routing under constraints: problem of visit to megalopolises (Q510285) (← links)
• Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
• Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174) (← links)
• On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space (Q643801) (← links)
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
• Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
• 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
• Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
• Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
• A discrete-continuous routing problem with precedence constraints (Q721512) (← links)
• Solving the family traveling salesman problem (Q723922) (← links)
• The indefinite period traveling salesman problem (Q724039) (← links)
• Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
• Designing group behavior algorithms for autonomous underwater vehicles in the underwater local heterogeneities survey problem (Q747241) (← links)
• A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
• Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
• Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
• Scheduling periodic customer visits for a traveling salesperson (Q863999) (← links)
• Greedy-type resistance of combinatorial problems (Q865746) (← links)
• A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
• Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem (Q885705) (← links)
• Maximum travelling salesman problem. I (Q891481) (← links)