Pages that link to "Item:Q4347415"

The following pages link to The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms (Q4347415):

Displaying 42 items.

• On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
• A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
• Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
• Greedy-type resistance of combinatorial problems (Q865746) (← links)
• Dominance guarantees for above-average solutions (Q937396) (← links)
• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
• A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← links)
• Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
• Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
• Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
• Domination analysis of greedy heuristics for the frequency assignment problem. (Q1420614) (← 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)
• New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
• The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
• Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
• The generalized vertex cover problem and some variations (Q1756348) (← links)
• Extended neighborhood: Definition and characterization (Q1764249) (← links)
• Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
• Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
• Minimum number of below average triangles in a weighted complete graph (Q2465935) (← links)
• A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838) (← links)
• A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158) (← links)
• Development of new artificial intelligence systems for solving the travelling salesman problem (Q2850354) (← links)
• Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System (Q2971639) (← links)
• A New Formulation for the Travelling Salesman Problem (Q3315280) (← links)
• (Q3385394) (← links)
• Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
• The travelling salesman and the PQ-tree (Q4645944) (← links)
• Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
• The Bipartite QUBO (Q5050150) (← links)
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
• Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
• TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)
• Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks (Q6169990) (← links)
• Some contributions of Ailsa H. Land to the study of the traveling salesman problem (Q6169992) (← links)