Hojny, Christopher; Joormann, Imke; Lüthen, Hendrik; Schmidt, Martin Mixed-integer programming techniques for the connected max-\(k\)-cut problem. (English) Zbl 1473.90092 Math. Program. Comput. 13, No. 1, 75-132 (2021). MSC: 90C11 90C35 90C57 PDFBibTeX XMLCite \textit{C. Hojny} et al., Math. Program. Comput. 13, No. 1, 75--132 (2021; Zbl 1473.90092) Full Text: DOI
Hojny, Christopher Packing, partitioning, and covering symresacks. (English) Zbl 1446.90110 Discrete Appl. Math. 283, 689-717 (2020). MSC: 90C10 90C57 PDFBibTeX XMLCite \textit{C. Hojny}, Discrete Appl. Math. 283, 689--717 (2020; Zbl 1446.90110) Full Text: DOI
Geyer, Andrew J.; Bulutoglu, Dursun A.; Ryan, Kenneth J. Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays. (English) Zbl 1474.90276 Discrete Optim. 32, 93-119 (2019). MSC: 90C05 90C10 68R10 90C57 PDFBibTeX XMLCite \textit{A. J. Geyer} et al., Discrete Optim. 32, 93--119 (2019; Zbl 1474.90276) Full Text: DOI arXiv
Pfetsch, Marc E.; Rehn, Thomas A computational comparison of symmetry handling methods for mixed integer programs. (English) Zbl 1411.90233 Math. Program. Comput. 11, No. 1, 37-93 (2019). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{M. E. Pfetsch} and \textit{T. Rehn}, Math. Program. Comput. 11, No. 1, 37--93 (2019; Zbl 1411.90233) Full Text: DOI
Fampa, Marcia; Lee, Jon; Melo, Wendel A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space. (English) Zbl 1353.90165 Comput. Optim. Appl. 65, No. 1, 47-71 (2016). MSC: 90C35 90C11 90C57 PDFBibTeX XMLCite \textit{M. Fampa} et al., Comput. Optim. Appl. 65, No. 1, 47--71 (2016; Zbl 1353.90165) Full Text: DOI
Dias, Gustavo; Liberti, Leo Orbital independence in symmetric mathematical programs. (English) Zbl 1478.90096 Lu, Zaixin (ed.) et al., Combinatorial optimization and applications. 9th international conference, COCOA 2015, Houston, TX, USA, December 18–20, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9486, 467-480 (2015). MSC: 90C26 90C57 PDFBibTeX XMLCite \textit{G. Dias} and \textit{L. Liberti}, Lect. Notes Comput. Sci. 9486, 467--480 (2015; Zbl 1478.90096) Full Text: DOI
Ostrowski, James; Linderoth, Jeff; Rossi, Fabrizio; Smriglio, Stefano Solving large Steiner Triple Covering Problems. (English) Zbl 1218.90103 Oper. Res. Lett. 39, No. 2, 127-131 (2011). MSC: 90B80 90C10 90C57 PDFBibTeX XMLCite \textit{J. Ostrowski} et al., Oper. Res. Lett. 39, No. 2, 127--131 (2011; Zbl 1218.90103) Full Text: DOI Link
Boyd, Sylvia; Elliott-Magwood, Paul Structure of the extreme points of the subtour elimination polytope of the STSP. (English) Zbl 1223.90050 RIMS Kôkyûroku Bessatsu B23, 33-47 (2010). MSC: 90C27 90C57 90C60 PDFBibTeX XMLCite \textit{S. Boyd} and \textit{P. Elliott-Magwood}, RIMS Kôkyûroku Bessatsu B23, 33--47 (2010; Zbl 1223.90050)
Benoit, Geneviève; Boyd, Sylvia Finding the exact integrality gap for small traveling salesman problems. (English) Zbl 1218.90167 Math. Oper. Res. 33, No. 4, 921-931 (2008). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{G. Benoit} and \textit{S. Boyd}, Math. Oper. Res. 33, No. 4, 921--931 (2008; Zbl 1218.90167) Full Text: DOI Link
Margot, François Exploiting orbits in symmetric ILP. (English) Zbl 1082.90070 Math. Program. 98, No. 1-3 (B), 3-21 (2003). MSC: 90C10 90C57 90C08 PDFBibTeX XMLCite \textit{F. Margot}, Math. Program. 98, No. 1--3 (B), 3--21 (2003; Zbl 1082.90070) Full Text: DOI
Margot, François Pruning by isomorphism in branch-and-cut. (English) Zbl 1023.90088 Math. Program. 94, No. 1 (A), 71-90 (2002). MSC: 90C57 90C09 PDFBibTeX XMLCite \textit{F. Margot}, Math. Program. 94, No. 1 (A), 71--90 (2002; Zbl 1023.90088) Full Text: DOI Link
Moura, Lucia A polyhedral algorithm for packings and designs. (English) Zbl 0935.05031 Nešetřil, Jaroslav (ed.), Algorithms - ESA ’99. 7th annual European symposium, Prague, Czech Republic, July 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1643, 462-475 (1999). Reviewer: Patric R.J.Östergård (Helsinki) MSC: 05B40 05B05 90C57 05C69 PDFBibTeX XMLCite \textit{L. Moura}, Lect. Notes Comput. Sci. 1643, 462--475 (1999; Zbl 0935.05031)