Biq Mac
From MaRDI portal
swMATH10532MaRDI QIDQ22491FDOQ22491
Author name not available (Why is that?)
Official website: http://biqmac.uni-klu.ac.at/
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
- Lifting and separation procedures for the cut polytope
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- 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
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- 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
- An exact combinatorial algorithm for minimum graph bisection
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- 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
- 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
- Convex optimization under combinatorial sparsity constraints
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- 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
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Cuts in undirected graphs. I
- QAPLIB
- Concorde
- CirCut
- COL
- QSDP
- SDPLR
- ConicBundle
- FIR toolbox
- SpeeDP
- CQP
- SDP_S
- race
- PANDA
- SDPNAL
- ACOTSP
- BiqMac
- DISCO
- DryadOpt
- dsyevx
- SDPNAL+
- QuadProgBB
- MADAM
- CLIP
- SCIP-SDP
- TSpack
- Memetic search for the max-bisection problem
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- QSDPNAL
- FrogCOL
- PARTY
- mplp2
- BOB
- Osprey
- MIQCR-CB
- Rudy
- BiqCrunch
- DQP
- QPLIB
- BBCPOP
- 2EBD-HPE
- Sparse-BSOS
- POLIP
- BiqBin
- quadprogIP
- 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
- 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
- A new approximation hierarchy for polynomial conic optimization
- An exact algorithm for graph partitioning
- Computational protein design as an optimization 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
- QPPAL
- QUBO software
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- Techniques for submodular maximization
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- From Graph Orientation to the Unweighted Maximum Cut
- Global convergence of the alternating projection method for the max-cut relaxation problem
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- A framework for solving mixed-integer semidefinite programs
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Engineering branch-and-cut algorithms for the equicut problem
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
This page was built for software: Biq Mac
