Cited in
(11)- Spectral bounds for graph partitioning with prescribed partition sizes
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- ConicBundle
- SBmethod
- EIQP IIQP
- IQCP/MIQCP
- BBCPOP
- Mixing convex-optimization bounds for maximum-entropy sampling
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- On solving the densest \(k\)-subgraph problem on large graphs
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
This page was built for software: MIQCR-CB
