Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302): Difference between revisions

← Older edit

@@ Property / DOI @@
-.1016/j.ejor.2006.09.028
@@ Property / DOI: 10.1016/j.ejor.2006.09.028 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2006.09.028
+Normal rank
@@ Property / OpenAlex ID @@
+W2048804785
@@ Property / OpenAlex ID: W2048804785 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321548
@@ Property / cites work: Q4321548 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Linear programming for the \(0-1\) quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+A Heuristic Method for the Set Covering Problem
@@ Property / cites work: A Heuristic Method for the Set Covering Problem / rank @@
+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 @@
+Q4321552
@@ Property / cites work: Q4321552 / rank @@
+Normal rank
@@ Property / cites work @@
+The quadratic assignment problem. Theory and algorithms
+Normal rank
@@ Property / cites work @@
+A Lagrangian-based heuristic for large-scale set covering problems
+Normal rank
@@ Property / cites work @@
+The cut polytope and the Boolean quadric polytope
@@ Property / cites work: The cut polytope and the Boolean quadric polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Quadratic knapsack problems
@@ Property / cites work: Quadratic knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
+Normal rank
@@ Property / cites work @@
+A level-2 reformulation-linearization technique bound for the quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+Some Network Flow Problems Solved with Pseudo-Boolean Programming
+Normal rank
@@ Property / cites work @@
+Roof duality, complementation and persistency in quadratic 0–1 optimization
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+A dual framework for lower bounds of the quadratic assignment problem based on linearization
+Normal rank
@@ Property / cites work @@
+The Quadratic Assignment Problem
@@ Property / cites work: The Quadratic Assignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Upper bounds and exact algorithms for \(p\)-dispersion problems
+Normal rank
@@ Property / cites work @@
+Q4550779
@@ Property / cites work: Q4550779 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2006.09.028
@@ Property / DOI: 10.1016/J.EJOR.2006.09.028 / rank @@
+Normal rank
@@ Property / Recommended article @@
+A polyhedral approach for a constrained quadratic 0-1 problem
+Normal rank
+Similarity Score: 0.92644054Amount 0.92644054
Unit 1
-Amount
+.92644054
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4501308
@@ Property / Recommended article: Q4501308 / rank @@
+Normal rank
@@ Property / Recommended article: Q4501308 / qualifier @@
+Similarity Score: 0.923344Amount 0.923344
Unit 1
-Amount
+.923344
 Unit
@@ Property / Recommended article: Q4501308 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Extended canonical duality and conic programming for solving 0-1 quadratic programming problems
+Normal rank
+Similarity Score: 0.916969Amount 0.916969
Unit 1
-Amount
+.916969
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
+Normal rank
+Similarity Score: 0.9109319Amount 0.9109319
Unit 1
-Amount
+.9109319
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Quadratic convex reformulations for quadratic 0-1 programming
+Normal rank
+Similarity Score: 0.9099747Amount 0.9099747
Unit 1
-Amount
+.9099747
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
+Normal rank
+Similarity Score: 0.9058645Amount 0.9058645
Unit 1
-Amount
+.9058645
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Convex quadratic programming with one constraint and bounded variables
+Normal rank
+Similarity Score: 0.9038407Amount 0.9038407
Unit 1
-Amount
+.9038407
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
+Normal rank
+Similarity Score: 0.9030119Amount 0.9030119
Unit 1
-Amount
+.9030119
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4005777
@@ Property / Recommended article: Q4005777 / rank @@
+Normal rank
@@ Property / Recommended article: Q4005777 / qualifier @@
+Similarity Score: 0.90240836Amount 0.90240836
Unit 1
-Amount
+.90240836
 Unit
@@ Property / Recommended article: Q4005777 / qualifier @@
+Recommender Run: Recommender Run 2