Revision as of 08:20, 24 April 2024 edit Swmar (talk \| contribs) 6 edits m →Proof of NP-hardness: fixed a typo - we need to specify a linear constraint on y_u, not y_v (as y_v already has integer constraint) Tag: Visual edit ← Previous edit		Revision as of 10:52, 24 April 2024 edit undo Swmar (talk \| contribs) 6 edits m →Proof of NP-hardness: model can be further simplified, we don't need linear constraints in ILP Tag: Visual edit Next edit →
Line 61: \min \sum_{v \in V} y_v \\ y_v + y_u & \ge 1 && \forall uv \in E\\ ~~y_u~~y_v & \gein 0\mathbb{Z^{+}} && \forall v \in V\\ ~~y_v & \in \mathbb{Z} && \forall v \in V~~ \end{align}</math>

Integer programming: Difference between revisions