Pages that link to "Item:Q1602706"
From MaRDI portal
The following pages link to Domination analysis of some heuristics for the traveling salesman problem (Q1602706):
Displaying 24 items.
- Cyclic transfers in school timetabling (Q421072) (← 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)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← 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)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
- TSP heuristics: domination analysis and complexity (Q1566378) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← 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)
- On patching algorithms for random asymmetric travelling salesman problems (Q1813831) (← links)
- When the greedy algorithm fails (Q2386197) (← links)
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem (Q2571201) (← links)
- A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158) (← links)
- Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System (Q2971639) (← links)
- (Q2998795) (← links)
- On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem (Q4427335) (← links)
- TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)