Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

2
  • $\begingroup$ A very simillar approach is in this paper: ncbi.nlm.nih.gov/pmc/articles/PMC1865583 $\endgroup$ Commented Jun 24, 2015 at 10:57
  • 1
    $\begingroup$ Keep in mind that size isn't everything when looking at integer programming! The downside of the shorter constraints you suggest is that the LP relaxation that is solved as a subproblem for the MILP problem is not strong. You can see that by noting that, e.g., the upper bounding inequality for 'AND' becomes active (i.e., equality holds) for the non integral points (x1, x2, y) = (0, 1, 0.5) or (1, 0, 0.5) or (1, 1, 0.5). $\endgroup$ Commented Dec 26, 2020 at 18:38