Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982): Difference between revisions

@@ Property / author @@
+D. Rodríguez-Gómez
@@ Property / author: D. Rodríguez-Gómez / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 90C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C26
@@ Property / Mathematics Subject Classification ID: 90C26 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6362616
@@ Property / zbMATH DE Number: 6362616 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+binary quadratic programming
@@ Property / zbMATH Keywords: binary quadratic programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximate methods
@@ Property / zbMATH Keywords: approximate methods / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+global equilibrium search
@@ Property / zbMATH Keywords: global equilibrium search / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational experiment
@@ Property / zbMATH Keywords: computational experiment / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+comparative analysis of algorithms
@@ Property / zbMATH Keywords: comparative analysis of algorithms / rank @@
+Normal rank

Revision as of 13:45, 30 June 2023