The following pages link to (Q4400647):
Displaying 22 items.
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- On the transportation problem with market choice (Q479018) (← links)
- Cutting plane algorithms and approximate lower subdifferentiability (Q535075) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- A semidefinite programming approach to the quadratic knapsack problem (Q1583699) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- A relaxed cutting plane method for semi-infinite semi-definite programming (Q2503018) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- (Q2751323) (← links)
- An improved interior-point cutting-plane method for binary quadratic optimization (Q2883644) (← links)
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- (Q3748063) (← links)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
- (Q4906149) (← links)
- (Q5294045) (← links)
- On the complexity of separating cutting planes for the knapsack polytope (Q6589743) (← links)
