The following pages link to BiqCrunch (Q3133583):
Displaying 22 items.
- BiqCrunch (Q35457) (← links)
- A subgradient approach for constrained binary optimization via quantum adiabatic evolution (Q1699979) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- BDD-based optimization for the quadratic stable set problem (Q2673237) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
- An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
- Faster exact solution of sparse maxcut and QUBO problems (Q6095734) (← links)
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming (Q6116234) (← links)
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut (Q6579779) (← links)
- A semidefinite approach for the single row facility layout problem (Q6606626) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)
