The following pages link to BiqMac (Q24588):
Displaying 27 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
- Maximum cut in fuzzy nature: models and algorithms (Q964947) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis (Q2205985) (← links)
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- A novel approach for solving semidefinite programs (Q2336591) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- A Hopfield neural network applied to the fuzzy maximum cut problem under credibility measure (Q2510156) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- A Newton-bracketing method for a simple conic optimization problem (Q4999334) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- BiqBin: Moving Boundaries for NP-hard Problems by HPC (Q5119114) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
