MIQCR-CB

swMATH21604MaRDI QIDQ33409FDOQ33409

Author name not available (Why is that?)

Described by source

• Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation

Cited In (6)

• Spectral bounds for graph partitioning with prescribed partition sizes
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• On solving the densestk-subgraph problem on large graphs
• Mixing convex-optimization bounds for maximum-entropy sampling
• \texttt{EXPEDIS}: an exact penalty method over discrete sets
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

This page was built for software: MIQCR-CB