Testing optimality for quadratic 0?1 unconstrained problems (Q4859451): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean Elements in Combinatorial Optimization
@@ Property / cites work: Boolean Elements in Combinatorial Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538300
@@ Property / cites work: Q5538300 / rank @@
+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 @@
+Q3972966
@@ Property / cites work: Q3972966 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of local maxima in quadratic 0-1 programs
+Normal rank
@@ Property / cites work @@
+Complexity of uniqueness and local search in quadratic 0-1 programming
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank