Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831): Difference between revisions

@@ Property / cites work @@
+A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
+Normal rank
@@ Property / cites work @@
+Linear programming for the \(0-1\) quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+A new upper bound for the 0-1 quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+Q3835301
@@ Property / cites work: Q3835301 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition and linearization for 0-1 quadratic programming
+Normal rank
@@ Property / cites work @@
+An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
+Normal rank
@@ Property / cites work @@
+A semidefinite programming approach to the quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+Min-cut clustering
@@ Property / cites work: Min-cut clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Cardinality constrained Boolean quadratic polytope
+Normal rank
@@ Property / cites work @@
+Lagrangean methods for the 0-1 quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+The Boolean quadratic polytope: Some characteristics, facets and relatives
+Normal rank
@@ Property / cites work @@
+Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Lifting the facets of zero–one polytopes
@@ Property / cites work: Lifting the facets of zero–one polytopes / rank @@
+Normal rank