For convex MIQPs with indicator variables and a constraint-block graph of bounded treewidth, the authors present a polynomial-time algorithm that computes a solution that is near-feasible, superoptimal, and satisfies all combinatorial constraints, plus matching NP-hardness results.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Solving convex QPs with structured sparsity under indicator conditions
For convex MIQPs with indicator variables and a constraint-block graph of bounded treewidth, the authors present a polynomial-time algorithm that computes a solution that is near-feasible, superoptimal, and satisfies all combinatorial constraints, plus matching NP-hardness results.