Pages that link to "Item:Q1290621"
From MaRDI portal
The following pages link to Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621):
Displaying 32 items.
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods (Q2576741) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Calmness of partial perturbation to composite rank constraint systems and its applications (Q2694518) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Stochastic quadratic knapsack with recourse (Q2883557) (← 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)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
- Continuous Approaches to the Unconstrained Binary Quadratic Problems (Q2958833) (← links)
- Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA (Q3057146) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- (Q4348956) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Introduction to QUBO (Q5050141) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming (Q5502239) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072) (← links)
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)
- An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- A preconditioned iterative interior point approach to the conic bundle subproblem (Q6126660) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)