Biq Mac
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Sparse-BSOS
- POLIP
- BiqBin
- quadprogIP
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- On global optimization with indefinite quadratics
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- Contraction-based separation and lifting for solving the max-cut problem
- Cuts in undirected graphs. I
- Cuts in undirected graphs. II
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Techniques for submodular maximization
- Memetic search for the max-bisection problem
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems
- Discrete optimization with decision diagrams
- Duality gap estimation of linear equality constrained binary quadratic programming
- QPPAL
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- 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
- Valuated matroid-based algorithm for submodular welfare problem
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
- MADAM
- Capping methods for the automatic configuration of optimization algorithms
- SDPSymmetryReduction.jl
- SOS-SDP
- ACVIZ
- CAPOPT
- HHBQP
- A Newton-bracketing method for a simple conic optimization problem
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- A new approximation hierarchy for polynomial conic optimization
- Solving \(k\)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
- Linear programing relaxations for a strategic pricing problem in electricity markets
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- From Graph Orientation to the Unweighted Maximum Cut
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- Global convergence of the alternating projection method for the max-cut relaxation problem
- An exact algorithm for graph partitioning
- A note on the 2-circulant inequalities for the MAX-cut problem
- Computational protein design as an optimization problem
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- The Boolean quadric polytope
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- Exact solution methods for the \(k\)-item quadratic knapsack problem
- MQLib
- An active-set method for second-order conic-constrained quadratic programming
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- A novel approach for solving semidefinite programs
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- A framework for solving mixed-integer semidefinite programs
- Lifting and separation procedures for the cut polytope
- Engineering branch-and-cut algorithms for the equicut problem
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- QPLIB: a library of quadratic programming instances
- Mathematical programming models and exact algorithms
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- A new separation algorithm for the Boolean quadric and cut polytopes
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Alternating direction augmented Lagrangian methods for semidefinite programming
- QUBO software
- A multilevel analysis of the Lasserre hierarchy
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- An exact combinatorial algorithm for minimum graph bisection
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
- An improved interior-point cutting-plane method for binary quadratic optimization
- Improving spectral bounds for clustering problems by Lagrangian relaxation
- A unified approach to mixed-integer optimization problems with logical constraints
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Dantzig-Wolfe reformulations for binary quadratic problems
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- Volume computation for sparse Boolean quadric relaxations
- Local search inequalities
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Gaussian mean field lattice gas
- Spectral bounds for graph partitioning with prescribed partition sizes
- Extensions on ellipsoid bounds for quadratic integer programming
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- 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 -k-cut and chromatic number of a graph
- Maximum-entropy sampling and the Boolean quadric polytope
- Maximum cut in fuzzy nature: models and algorithms
- Generalised 2-circulant inequalities for the max-cut problem
- Computational approaches to MAX-cut
- A class of spectral bounds for max \(k\)-cut
This page was built for software: Biq Mac
