Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(92)90043-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1971496656
@@ Property / OpenAlex ID: W1971496656 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition problems for special classes of polynomials in 0-1 variables
+Normal rank
@@ Property / cites work @@
+Methods of Nonlinear 0-1 Programming
@@ Property / cites work: Methods of Nonlinear 0-1 Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538300
@@ Property / cites work: Q5538300 / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Construction of test problems in quadratic bivalent programming
+Normal rank
@@ Property / cites work @@
+Graph separation techniques for quadratic zero-one programming
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / cites work @@
+Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
+Normal rank
@@ Property / cites work @@
+Checking local optimality in constrained quadratic programming is NP- hard
+Normal rank
@@ Property / cites work @@
+Simple Local Search Problems that are Hard to Solve
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1197889