Compact linearization for binary quadratic problems (Q2477615): Difference between revisions

@@ Property / cites work @@
+A polynomial case of unconstrained zero-one quadratic optimization
+Normal rank
@@ Property / cites work @@
+Compact mathematical formulation for graph partitioning
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Quadratic Knapsack Problem
@@ Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Formulations and valid inequalities of the node capacitated graph partitioning problem
+Normal rank
@@ Property / cites work @@
+On the quadratic assignment problem
@@ Property / cites work: On the quadratic assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538300
@@ Property / cites work: Q5538300 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Assignment Problems and the Location of Economic Activities
+Normal rank
@@ Property / cites work @@
+Location, scheduling, design and integer programming
+Normal rank
@@ Property / cites work @@
+Q4321564
@@ Property / cites work: Q4321564 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
+Normal rank
@@ Property / cites work @@
+Tighter representations for set partitioning problems
+Normal rank