The following pages link to Biq Mac (Q22491):
Displaying 50 items.
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- A novel approach for solving semidefinite programs (Q2336591) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- Computational protein design as an optimization problem (Q2453727) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Discrete optimization with decision diagrams (Q2806864) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (Q2826815) (← links)
- Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- Techniques for Submodular Maximization (Q2848998) (← 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)
- Linear programing relaxations for a strategic pricing problem in electricity markets (Q2968496) (← links)
- Polynomially Solvable Cases of Binary Quadratic Programs (Q3059290) (← links)
- (Q3094163) (← links)
- Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming (Q3169124) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Improving spectral bounds for clustering problems by Lagrangian relaxation (Q4918244) (← links)
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) (Q4972547) (← links)
- A Newton-bracketing method for a simple conic optimization problem (Q4999334) (← links)
- Global convergence of the alternating projection method for the Max-Cut relaxation problem (Q5005866) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- QUBO Software (Q5050151) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method (Q5265177) (← links)
- An SDP approach to multi-level crossing minimization (Q5406272) (← links)
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming (Q5502239) (← links)
- QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems (Q5882949) (← 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)
