MathDB1 problem
The separation problem asks whether, for a given sparse separable bilinear program and point, a violated lifted bilinear cover inequality can be found. NP-hardness conjecture. We c…
The separation problem asks whether, for a given sparse separable bilinear program and point, a violated lifted bilinear cover inequality can be found. NP-hardness conjecture. We c…