He, Edward; Boland, Natashia; Nemhauser, George; Savelsbergh, Martin An exact algorithm for the service network design problem with hub capacity constraints. (English) Zbl 1528.90109 Networks 80, No. 4, 572-596 (2022). MSC: 90B35 90B10 PDFBibTeX XMLCite \textit{E. He} et al., Networks 80, No. 4, 572--596 (2022; Zbl 1528.90109) Full Text: DOI
Bodur, Merve; Ahmed, Shabbir; Boland, Natashia; Nemhauser, George L. Decomposition of loosely coupled integer programs: a multiobjective perspective. (English) Zbl 1506.90160 Math. Program. 196, No. 1-2 (B), 427-477 (2022). MSC: 90C10 90C29 PDFBibTeX XMLCite \textit{M. Bodur} et al., Math. Program. 196, No. 1--2 (B), 427--477 (2022; Zbl 1506.90160) Full Text: DOI
Siebert, Matias; Ahmed, Shabbir; Nemhauser, George A linear programming based approach to the Steiner tree problem with a fixed number of terminals. (English) Zbl 07764307 Networks 75, No. 2, 124-136 (2020). MSC: 90Cxx PDFBibTeX XMLCite \textit{M. Siebert} et al., Networks 75, No. 2, 124--136 (2020; Zbl 07764307) Full Text: DOI arXiv
Munguía, Lluís-Miquel; Ahmed, Shabbir; Bader, David A.; Nemhauser, George L.; Shao, Yufen Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs. (English) Zbl 1392.90085 Comput. Optim. Appl. 69, No. 1, 1-24 (2018). MSC: 90C11 90C59 PDFBibTeX XMLCite \textit{L.-M. Munguía} et al., Comput. Optim. Appl. 69, No. 1, 1--24 (2018; Zbl 1392.90085) Full Text: DOI
Andrade, Carlos E.; Ahmed, Shabbir; Nemhauser, George L.; Shao, Yufen A hybrid primal heuristic for finding feasible solutions to mixed integer programs. (English) Zbl 1380.90193 Eur. J. Oper. Res. 263, No. 1, 62-71 (2017). MSC: 90C11 90C59 PDFBibTeX XMLCite \textit{C. E. Andrade} et al., Eur. J. Oper. Res. 263, No. 1, 62--71 (2017; Zbl 1380.90193) Full Text: DOI
Le Bodic, Pierre; Nemhauser, George An abstract model for branching and its application to mixed integer programming. (English) Zbl 1386.90087 Math. Program. 166, No. 1-2 (A), 369-405 (2017); erratum ibid. 166, No. 1-2 (A), 407 (2017). MSC: 90C11 90C60 68Q25 PDFBibTeX XMLCite \textit{P. Le Bodic} and \textit{G. Nemhauser}, Math. Program. 166, No. 1--2 (A), 369--405 (2017; Zbl 1386.90087) Full Text: DOI arXiv
Dilkina, Bistra; Khalil, Elias B.; Nemhauser, George L. Comments on: “On learning and branching: a survey”. (English) Zbl 1372.90116 Top 25, No. 2, 242-246 (2017). MSC: 90C57 68T05 90C11 90C59 PDFBibTeX XMLCite \textit{B. Dilkina} et al., Top 25, No. 2, 242--246 (2017; Zbl 1372.90116) Full Text: DOI
Guzelsoy, Menal; Nemhauser, George; Savelsbergh, Martin Restrict-and-relax search for 0-1 mixed-integer programs. (English) Zbl 1296.90081 EURO J. Comput. Optim. 1, No. 1-2, 201-218 (2013). MSC: 90C11 65K05 PDFBibTeX XMLCite \textit{M. Guzelsoy} et al., EURO J. Comput. Optim. 1, No. 1--2, 201--218 (2013; Zbl 1296.90081) Full Text: DOI
Karzan, Fatma Kılınç; Nemhauser, George L.; Savelsbergh, Martin W. P. Information-based branching schemes for binary linear mixed integer problems. (English) Zbl 1184.90114 Math. Program. Comput. 1, No. 4, 249-293 (2009). MSC: 90C11 90C57 90-08 90-04 PDFBibTeX XMLCite \textit{F. K. Karzan} et al., Math. Program. Comput. 1, No. 4, 249--293 (2009; Zbl 1184.90114) Full Text: DOI