Biq Mac
From MaRDI portal
Software:22491
No author found.
Related Items (only showing first 100 items - show all)
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization ⋮ QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems ⋮ BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints ⋮ On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ Dantzig-Wolfe reformulations for binary quadratic problems ⋮ Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ The Boolean Quadric Polytope ⋮ Mathematical Programming Models and Exact Algorithms ⋮ QUBO Software ⋮ Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Memetic search for the max-bisection problem ⋮ Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem ⋮ LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison ⋮ Computational study of valid inequalities for the maximum \(k\)-cut problem ⋮ On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Semidefinite relaxations for non-convex quadratic mixed-integer programming ⋮ SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ A class of spectral bounds for max \(k\)-cut ⋮ Generalised 2-circulant inequalities for the max-cut problem ⋮ \texttt{EXPEDIS}: an exact penalty method over discrete sets ⋮ Computational study of a branching algorithm for the maximum \(k\)-cut problem ⋮ A note on the 2-circulant inequalities for the MAX-cut problem ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ Lifting and separation procedures for the cut polytope ⋮ Alternating direction augmented Lagrangian methods for semidefinite programming ⋮ A semidefinite optimization approach to the target visitation problem ⋮ New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph ⋮ A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring ⋮ An exact algorithm for graph partitioning ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ Linear programing relaxations for a strategic pricing problem in electricity markets ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs ⋮ Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis ⋮ Certifiably optimal sparse inverse covariance estimation ⋮ Improved semidefinite bounding procedure for solving max-cut problems to optimality ⋮ On global optimization with indefinite quadratics ⋮ A semidefinite relaxation based global algorithm for two-level graph partition problem ⋮ Cuts in undirected graphs. I ⋮ Cuts in undirected graphs. II ⋮ Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches ⋮ On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ Computational protein design as an optimization problem ⋮ Unnamed Item ⋮ \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM ⋮ A multilevel analysis of the Lasserre hierarchy ⋮ A branch-and-bound algorithm for solving max-\(k\)-cut problem ⋮ Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem ⋮ Valuated matroid-based algorithm for submodular welfare problem ⋮ Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques ⋮ A framework for solving mixed-integer semidefinite programs ⋮ A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming ⋮ An SDP approach to multi-level crossing minimization ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs ⋮ Local search inequalities ⋮ Gaussian mean field lattice gas ⋮ Maximum-entropy sampling and the Boolean quadric polytope ⋮ Improving spectral bounds for clustering problems by Lagrangian relaxation ⋮ Maximum cut in fuzzy nature: models and algorithms ⋮ Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem ⋮ Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem ⋮ Parametric Lagrangian dual for the binary quadratic programming problem ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ Extensions on ellipsoid bounds for quadratic integer programming ⋮ Polynomially Solvable Cases of Binary Quadratic Programs ⋮ QPLIB: a library of quadratic programming instances ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ Theoretical and computational study of several linearisation techniques for binary quadratic problems ⋮ Computational Approaches to Max-Cut ⋮ Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results ⋮ Discrete Optimization with Decision Diagrams ⋮ Faster, but weaker, relaxations for quadratically constrained quadratic programs ⋮ Volume computation for sparse Boolean quadric relaxations ⋮ A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems ⋮ An exact combinatorial algorithm for minimum graph bisection ⋮ From Graph Orientation to the Unweighted Maximum Cut ⋮ SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) ⋮ Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting ⋮ Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations ⋮ Exact Solution Methods for the k-Item Quadratic Knapsack Problem ⋮ A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases ⋮ Spectral bounds for graph partitioning with prescribed partition sizes ⋮ A Newton-bracketing method for a simple conic optimization problem ⋮ An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming ⋮ Engineering Branch-and-Cut Algorithms for the Equicut Problem ⋮ Techniques for Submodular Maximization ⋮ Global convergence of the alternating projection method for the Max-Cut relaxation problem ⋮ A novel approach for solving semidefinite programs ⋮ A new separation algorithm for the Boolean quadric and cut polytopes ⋮ Convex optimization under combinatorial sparsity constraints ⋮ Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems
This page was built for software: Biq Mac
