Intersection Cuts—A New Type of Cutting Planes for Integer Programming

Citations

Cited by:

1. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
2. Amitabh Basu & Gérard Cornuéjols & François Margot, 2012. "Intersection Cuts with Infinite Split Rank," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 21-40, February.
3. Egon Balas & Gérard Cornuéjols & Tamás Kis & Giacomo Nannicini, 2013. "Combining Lift-and-Project and Reduce-and-Split," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 475-487, August.
4. Kent Andersen & Gérard Cornuéjols & Yanjun Li, 2005. "Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts," Management Science, INFORMS, vol. 51(11), pages 1720-1732, November.
5. Jing Hu & John Mitchell & Jong-Shi Pang & Bin Yu, 2012. "On linear programs with linear complementarity constraints," Journal of Global Optimization, Springer, vol. 53(1), pages 29-51, May.
6. Álinson S. Xavier & Ricardo Fukasawa & Laurent Poirrier, 2021. "Multirow Intersection Cuts Based on the Infinity Norm," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1624-1643, October.
7. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.
8. Egon Balas & Thiago Serra, 2020. "When Lift-and-Project Cuts Are Different," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 822-834, July.
9. Hu, Jian & Bansal, Manish & Mehrotra, Sanjay, 2018. "Robust decision making using a general utility set," European Journal of Operational Research, Elsevier, vol. 269(2), pages 699-714.
10. Karthekeyan Chandrasekaran & László A. Végh & Santosh S. Vempala, 2016. "The Cutting Plane Method is Polynomial for Perfect Matchings," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 23-48, February.
11. Alberto Del Pia & Robert Weismantel, 2016. "Relaxations of mixed integer sets from lattice-free polyhedra," Annals of Operations Research, Springer, vol. 240(1), pages 95-117, May.
12. Amitabh Basu & Pierre Bonami & Gérard Cornuéjols & François Margot, 2011. "Experiments with Two-Row Cuts from Degenerate Tableaux," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 578-590, November.
13. Gennadiy Averkov & Christian Wagner & Robert Weismantel, 2011. "Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 721-742, November.
14. Matteo Fischetti & Domenico Salvagnin, 2013. "Approximating the Split Closure," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 808-819, November.
15. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation I: foundations and taxonomy," 4OR, Springer, vol. 14(1), pages 1-40, March.
16. Mitchell, John E., 1997. "Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 139-148, February.
17. Santanu S. Dey & Andrea Lodi & Andrea Tramontani & Laurence A. Wolsey, 2014. "On the Practical Strength of Two-Row Tableau Cuts," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 222-237, May.
18. Santanu S. Dey & Quentin Louveaux, 2011. "Split Rank of Triangle and Quadrilateral Inequalities," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 432-461, August.
19. Alberto Del Pia, 2012. "On the Rank of Disjunctive Cuts," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 372-378, May.
20. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms," 4OR, Springer, vol. 14(2), pages 107-131, June.
21. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2015. "Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 105-129, February.
22. Trang T. Nguyen & Jean-Philippe P. Richard & Mohit Tawarmalani, 2021. "Convexification techniques for linear complementarity constraints," Journal of Global Optimization, Springer, vol. 80(2), pages 249-286, June.
23. Amitabh Basu & Michele Conforti & Marco Di Summa & Giacomo Zambelli, 2019. "Optimal Cutting Planes from the Group Relaxations," Management Science, INFORMS, vol. 44(4), pages 1208-1220, November.
24. Valentin Borozan & Gérard Cornuéjols, 2009. "Minimal Valid Inequalities for Integer Constraints," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 538-546, August.
25. Fischetti, Matteo & Monaci, Michele, 2020. "A branch-and-cut algorithm for Mixed-Integer Bilinear Programming," European Journal of Operational Research, Elsevier, vol. 282(2), pages 506-514.
26. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2017. "A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs," Operations Research, INFORMS, vol. 65(6), pages 1615-1637, December.
27. Fatma Kılınç-Karzan, 2016. "On Minimal Valid Inequalities for Mixed Integer Conic Programs," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 477-510, May.
28. Wesselmann, Franz & Koberstein, Achim & Suhl, Uwe H., 2011. "Pivot-and-reduce cuts: An approach for improving Gomory mixed-integer cuts," European Journal of Operational Research, Elsevier, vol. 214(1), pages 15-26, October.
29. Amitabh Basu & Michele Conforti & Gérard Cornuéjols & Giacomo Zambelli, 2010. "Maximal Lattice-Free Convex Sets in Linear Subspaces," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 704-720, August.
30. Akang Wang & Chrysanthos E. Gounaris, 2021. "On tackling reverse convex constraints for non-overlapping of unequal circles," Journal of Global Optimization, Springer, vol. 80(2), pages 357-385, June.