The following pages link to MIQCR-CB (Q33409):
Displaying 6 items.
- Mixing convex-optimization bounds for maximum-entropy sampling (Q2044968) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
