Universal conditions for algebraic travelling salesman problems to be efficiently solvable (Q3360022): Difference between revisions

@@ Property / cites work @@
+Q3999324
@@ Property / cites work: Q3999324 / rank @@
+Normal rank
@@ Property / cites work @@
+An algebraic approach to assignment problems
@@ Property / cites work: An algebraic approach to assignment problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4193256
@@ Property / cites work: Q4193256 / rank @@
+Normal rank
@@ Property / cites work @@
+An equivalency problem in discrete programming over ordered semigroups
+Normal rank
@@ Property / cites work @@
+Edgeconvex Circuits and the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+A solvable case of the traveling salesman problem
@@ Property / cites work: A solvable case of the traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Extreme Hamiltonian lines
@@ Property / cites work: Extreme Hamiltonian lines / rank @@
+Normal rank