MIQCR-CB

swMATH21604MaRDI QIDQ33409FDOQ33409

Author name not available (Why is that?)

Official website: http://pubsonline.informs.org/doi/abs/10.1287/ijoc.2016.0731

Described by source

• Using a conic bundle method to accelerate both phases of a quadratic convex reformulation

Cited In (8)

• Spectral bounds for graph partitioning with prescribed partition sizes
• Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
• Mixing convex-optimization bounds for maximum-entropy sampling
• EIQP IIQP
• IQCP/MIQCP
• \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