Pages that link to "Item:Q4012419"
From MaRDI portal
The following pages link to Cones of Matrices and Set-Functions and 0–1 Optimization (Q4012419):
Displaying 10 items.
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
