Biq Mac

swMATH10532MaRDI QIDQ22491FDOQ22491

Author name not available (Why is that?)

Described by source

• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

Cited In (only showing first 100 items - show all)

• A novel approach for solving semidefinite programs
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
• Theoretical and computational study of several linearisation techniques for binary quadratic problems
• Engineering branch-and-cut algorithms for the equicut problem
• Lifting and separation procedures for the cut polytope
• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
• QPLIB: a library of quadratic programming instances
• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
• Mathematical programming models and exact algorithms
• A new separation algorithm for the Boolean quadric and cut polytopes
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
• Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
• Improved semidefinite bounding procedure for solving max-cut problems to optimality
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Semidefinite relaxations for partitioning, assignment and ordering problems
• Alternating direction augmented Lagrangian methods for semidefinite programming
• A multilevel analysis of the Lasserre hierarchy
• An exact combinatorial algorithm for minimum graph bisection
• A unified approach to mixed-integer optimization problems with logical constraints
• A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
• Local search inequalities
• Gaussian mean field lattice gas
• Extensions on ellipsoid bounds for quadratic integer programming
• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
• Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
• Faster, but weaker, relaxations for quadratically constrained quadratic programs
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• Parametric Lagrangian dual for the binary quadratic programming problem
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
• Generalised 2-circulant inequalities for the max-cut problem
• Maximum cut in fuzzy nature: models and algorithms
• Computational approaches to MAX-cut
• A class of spectral bounds for max \(k\)-cut
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
• A semidefinite optimization approach to the target visitation problem
• Convex optimization under combinatorial sparsity constraints
• An SDP approach to multi-level crossing minimization
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
• Cutting plane generation through sparse principal component analysis
• A computational study and survey of methods for the single-row facility layout problem
• A branch-and-bound algorithm for solving max-\(k\)-cut problem
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
• On global optimization with indefinite quadratics
• SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
• Computational study of valid inequalities for the maximum \(k\)-cut problem
• Cuts in undirected graphs. I
• Cuts in undirected graphs. II
• Memetic search for the max-bisection problem
• CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
• Discrete optimization with decision diagrams
• Duality gap estimation of linear equality constrained binary quadratic programming
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
• Polynomially solvable cases of binary quadratic programs
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
• A Newton-bracketing method for a simple conic optimization problem
• Valuated matroid-based algorithm for submodular welfare problem
• Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
• BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
• A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
• Solving \(k\)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
• A new approximation hierarchy for polynomial conic optimization
• Linear programing relaxations for a strategic pricing problem in electricity markets
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
• An exact algorithm for graph partitioning
• Computational protein design as an optimization problem
• Exact solution methods for the \(k\)-item quadratic knapsack problem
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
• An active-set method for second-order conic-constrained quadratic programming
• Computational study of a branching algorithm for the maximum \(k\)-cut problem
• A framework for solving mixed-integer semidefinite programs
• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
• QUBO software
• \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
• Improving spectral bounds for clustering problems by Lagrangian relaxation
• An improved interior-point cutting-plane method for binary quadratic optimization
• Dantzig-Wolfe reformulations for binary quadratic problems
• What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
• Volume computation for sparse Boolean quadric relaxations
• Spectral bounds for graph partitioning with prescribed partition sizes
• Maximum-entropy sampling and the Boolean quadric polytope
• Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
• Certifiably optimal sparse inverse covariance estimation
• A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
• Contraction-based separation and lifting for solving the max-cut problem
• Techniques for submodular maximization
• QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems
• \texttt{EXPEDIS}: an exact penalty method over discrete sets
• Capping methods for the automatic configuration of optimization algorithms
• From Graph Orientation to the Unweighted Maximum Cut
• Global convergence of the alternating projection method for the max-cut relaxation problem
• A note on the 2-circulant inequalities for the MAX-cut problem
• The Boolean quadric polytope
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
• A semidefinite relaxation based global algorithm for two-level graph partition problem

This page was built for software: Biq Mac