Up a level |
Lodi, A., Tanneau, M., & Vielma, J. P. (2022). Disjunctive cuts in mixed-integer conic optimization. Mathematical Programming, 199(1-2), 671-719. External link
Lodi, A., Tanneau, M., & Vielma, J. P. (2019). Disjunctive cuts for mixed-integer conic optimization. (Technical Report n° 2019-42). External link
Tjandraatmadja, C., Anderson, R., Huchette, J., Ma, W., Patel, K., & Vielma, J. P. (2020, December). The convex relaxation barrier, revisited: Tightened single-neuron relaxations for neural network verification [Paper]. 34th Conference on Neural Information Processing Systems (NeurIPS 2020). Unavailable