A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-012-0458-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1993886527
@@ Property / OpenAlex ID: W1993886527 / rank @@
+Normal rank
@@ Property / cites work @@
+Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
+Normal rank
@@ Property / cites work @@
+The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
+Normal rank
@@ Property / cites work @@
+Q4247439
@@ Property / cites work: Q4247439 / rank @@
+Normal rank
@@ Property / cites work @@
+Construction of test problems in quadratic bivalent programming
+Normal rank
@@ Property / cites work @@
+Q4524243
@@ Property / cites work: Q4524243 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5494211
@@ Property / cites work: Q5494211 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / cites work @@
+Constrained global optimization: algorithms and applications
+Normal rank
@@ Property / cites work @@
+Q5670441
@@ Property / cites work: Q5670441 / rank @@
+Normal rank
@@ Property / cites work @@
+New results on the equivalence between zero-one programming and continuous concave programming
+Normal rank
@@ Property / cites work @@
+New optimality conditions for quadratic optimization problems with binary constraints
+Normal rank
@@ Property / cites work @@
+New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+Penalty parameter for linearly constrained 0--1 quadratic programming
+Normal rank