Pages that link to "Item:Q1566378"
From MaRDI portal
The following pages link to TSP heuristics: domination analysis and complexity (Q1566378):
Displayed 19 items.
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Symmetric weight constrained traveling salesman problem: Local search (Q535615) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- Greedy-type resistance of combinatorial problems (Q865746) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- Domination analysis of greedy heuristics for the frequency assignment problem. (Q1420614) (← 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)
- Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
- Novel concave hull-based heuristic algorithm for TSP (Q2139346) (← links)
- When the greedy algorithm fails (Q2386197) (← 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)
- Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
- The Bipartite QUBO (Q5050150) (← links)