Pages that link to "Item:Q1602705"

The following pages link to Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705):

Displaying 23 items.

• 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 survey for the quadratic assignment problem (Q852928) (← 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)
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← 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)
• Anti-matroids (Q1612010) (← 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)
• Extended neighborhood: Definition and characterization (Q1764249) (← links)
• Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
• Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
• When the greedy algorithm fails (Q2386197) (← links)
• A parallel water flow algorithm with local search for solving the quadratic assignment problem (Q2423282) (← links)
• Minimum number of below average triangles in a weighted complete graph (Q2465935) (← links)
• Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603) (← links)
• A domination algorithm for {0,1}-instances of the travelling salesman problem (Q2811158) (← links)
• TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)