Pages that link to "Item:Q5939600"
From MaRDI portal
The following pages link to TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600):
Displaying 15 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)
- Dominance guarantees for above-average solutions (Q937396) (← links)
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← 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)
- 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)
- Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
- Minimum number of below average triangles in a weighted complete graph (Q2465935) (← links)
- A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158) (← links)
- Multi-modal routing in urban transportation network using multi-objective quantum particle swarm optimization (Q6610995) (← links)