Greedy-type resistance of combinatorial problems (Q865746): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2006.03.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2077940370
@@ Property / OpenAlex ID: W2077940370 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+When the greedy algorithm fails
@@ Property / cites work: When the greedy algorithm fails / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+Domination analysis of combinatorial optimization problems.
+Normal rank
@@ Property / cites work @@
+Anti-matroids
@@ Property / cites work: Anti-matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5484515
@@ Property / cites work: Q5484515 / rank @@
+Normal rank
@@ Property / cites work @@
+TSP heuristics: domination analysis and complexity
+Normal rank