What is a Disjunction? - IEOR @IIT Bombay
What is a Disjunction? - IEOR @IIT Bombay
What is a Disjunction? - IEOR @IIT Bombay
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Computational Complexity<br />
The problem of finding the “best” d<strong>is</strong>junction <strong>is</strong>:<br />
◮ N P−complete in general (Reduction from Number Partitioning<br />
Problem)<br />
◮ N P−complete when π ∈ {0, 1} n<br />
◮ N P−complete when π ∈ {−1, 0, 1} n<br />
◮ N P−complete when (π, π 0 ) ∈ {0, 1} n+1<br />
◮ N P−complete when x ∈ {0, 1} n and either of above four<br />
conditions hold (Reduction from 1-IN-3SAT)<br />
. . . lead to similar results for some problems of generating split<br />
inequalities
Change language