A provable better Branch and Bound method for a nonconvex integer quadratic programming problem (Q1765223): Difference between revisions

@@ Property / cites work @@
+A note on adapting methods for continuous global optimization to the discrete case
+Normal rank
@@ Property / cites work @@
+Q3667913
@@ Property / cites work: Q3667913 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for indefinite integer quadratic programming
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5733470
@@ Property / cites work: Q5733470 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Q4321546
@@ Property / cites work: Q4321546 / rank @@
+Normal rank