The following pages link to BiqCrunch (Q35457):
Displaying 14 items.
- 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)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← 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)
- BiqBin: Moving Boundaries for NP-hard Problems by HPC (Q5119114) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← 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)
