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

@@ Property / author @@
-Wen-Xing Zhu
@@ Property / author: Wen-Xing Zhu / rank @@
-Normal rank
@@ Property / author @@
+Wen-Xing Zhu
@@ Property / author: Wen-Xing Zhu / rank @@
+Normal rank
@@ 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/j.jcss.2004.07.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2035506911
@@ Property / OpenAlex ID: W2035506911 / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:1765223