On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization (Q2810549): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+math/0701184
@@ Property / arXiv ID: math/0701184 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57434178
@@ Property / Wikidata QID: Q57434178 / rank @@
+Normal rank
@@ Property / cites work @@
+New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Optimality Conditions for the Minimization of Quadratic 0-1 Problems
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Equilibria, fixed points, and complexity classes
@@ Property / cites work: Equilibria, fixed points, and complexity classes / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1678159847
@@ Property / OpenAlex ID: W1678159847 / rank @@
+Normal rank