Kerivin, Hervé; Zhao, Jinhua A computational study on the maximum-weight bounded-degree rooted tree problem. (English) Zbl 1510.68079 Appl. Math. Comput. 413, Article ID 126623, 16 p. (2022). MSC: 68R10 68W25 90C27 90C57 PDFBibTeX XMLCite \textit{H. Kerivin} and \textit{J. Zhao}, Appl. Math. Comput. 413, Article ID 126623, 16 p. (2022; Zbl 1510.68079) Full Text: DOI
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
Sinnl, Markus Mixed-integer programming approaches for the time-constrained maximal covering routing problem. (English) Zbl 1476.90060 OR Spectrum 43, No. 2, 497-542 (2021). MSC: 90B06 90C57 90C27 90C11 PDFBibTeX XMLCite \textit{M. Sinnl}, OR Spectrum 43, No. 2, 497--542 (2021; Zbl 1476.90060) Full Text: DOI
Schmidt, Daniel; Zey, Bernd; Margot, François Stronger MIP formulations for the Steiner forest problem. (English) Zbl 1459.90188 Math. Program. 186, No. 1-2 (A), 373-407 (2021). MSC: 90C27 90C57 90B10 PDFBibTeX XMLCite \textit{D. Schmidt} et al., Math. Program. 186, No. 1--2 (A), 373--407 (2021; Zbl 1459.90188) Full Text: DOI
Arslan, Okan; Jabali, Ola; Laporte, Gilbert A flexible, natural formulation for the network design problem with vulnerability constraints. (English) Zbl 1451.90024 INFORMS J. Comput. 32, No. 1, 120-134 (2020). MSC: 90B10 05C82 90C35 90C57 PDFBibTeX XMLCite \textit{O. Arslan} et al., INFORMS J. Comput. 32, No. 1, 120--134 (2020; Zbl 1451.90024) Full Text: DOI
Álvarez-Miranda, Eduardo; Sinnl, Markus A branch-and-cut algorithm for the maximum covering cycle problem. (English) Zbl 1435.90119 Ann. Oper. Res. 284, No. 2, 487-499 (2020). MSC: 90C27 90C35 90C57 PDFBibTeX XMLCite \textit{E. Álvarez-Miranda} and \textit{M. Sinnl}, Ann. Oper. Res. 284, No. 2, 487--499 (2020; Zbl 1435.90119) Full Text: DOI
Álvarez-Miranda, Eduardo; Sinnl, Markus Mixed-integer programming approaches for the tree \(t^*\)-spanner problem. (English) Zbl 1430.90474 Optim. Lett. 13, No. 7, 1693-1709 (2019). MSC: 90C27 90C11 90C57 PDFBibTeX XMLCite \textit{E. Álvarez-Miranda} and \textit{M. Sinnl}, Optim. Lett. 13, No. 7, 1693--1709 (2019; Zbl 1430.90474) Full Text: DOI
Rehfeldt, Daniel; Koch, Thorsten Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem. (English) Zbl 1410.90130 SIAM J. Optim. 29, No. 1, 369-398 (2019). MSC: 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{D. Rehfeldt} and \textit{T. Koch}, SIAM J. Optim. 29, No. 1, 369--398 (2019; Zbl 1410.90130) Full Text: DOI
Schmidt, Daniel R.; Zey, Bernd; Margot, François An exact algorithm for the Steiner forest problem. (English) Zbl 1524.68242 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 70, 14 p. (2018). MSC: 68R10 68W25 90C35 PDFBibTeX XMLCite \textit{D. R. Schmidt} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 70, 14 p. (2018; Zbl 1524.68242) Full Text: DOI
Ceselli, Alberto; Damiani, Maria Luisa; Righini, Giovanni; Valorsi, Diego Mathematical programming algorithms for spatial cloaking. (English) Zbl 1528.90210 INFORMS J. Comput. 30, No. 4, 710-723 (2018). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{A. Ceselli} et al., INFORMS J. Comput. 30, No. 4, 710--723 (2018; Zbl 1528.90210) Full Text: DOI Link
Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems. (English) Zbl 1446.90060 INFORMS J. Comput. 30, No. 2, 402-420 (2018). MSC: 90B18 90C57 PDFBibTeX XMLCite \textit{M. Leitner} et al., INFORMS J. Comput. 30, No. 2, 402--420 (2018; Zbl 1446.90060) Full Text: DOI Link
Shinano, Yuji The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound. (English) Zbl 1397.90405 Kliewer, Natalia (ed.) et al., Operations research proceedings 2017. Selected papers of the annual international conference of the German Operations Research Society (GOR), Freie Universiät Berlin, Germany, September 6–8, 2017. Cham: Springer (ISBN 978-3-319-89919-0/pbk; 978-3-319-89920-6/ebook). Operations Research Proceedings, 143-149 (2018). MSC: 90C57 90C60 65Y05 68W10 PDFBibTeX XMLCite \textit{Y. Shinano}, Oper. Res. Proc. 2017, 143--149 (2018; Zbl 1397.90405) Full Text: DOI
Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus An algorithmic framework for the exact solution of tree-star problems. (English) Zbl 1403.90577 Eur. J. Oper. Res. 261, No. 1, 54-66 (2017). MSC: 90C27 68M14 90B80 90C35 90C57 PDFBibTeX XMLCite \textit{M. Leitner} et al., Eur. J. Oper. Res. 261, No. 1, 54--66 (2017; Zbl 1403.90577) Full Text: DOI Link
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus Solving minimum-cost shared arborescence problems. (English) Zbl 1394.90429 Eur. J. Oper. Res. 258, No. 3, 887-901 (2017). MSC: 90C10 90C35 90B10 90C11 90C57 PDFBibTeX XMLCite \textit{E. Álvarez-Miranda} et al., Eur. J. Oper. Res. 258, No. 3, 887--901 (2017; Zbl 1394.90429) Full Text: DOI
Liers, Frauke; Martin, Alexander; Pape, Susanne Binary Steiner trees: structural results and an exact solution approach. (English) Zbl 1387.90141 Discrete Optim. 21, 85-117 (2016). MSC: 90C10 90C27 05C05 90C35 90C57 92D15 PDFBibTeX XMLCite \textit{F. Liers} et al., Discrete Optim. 21, 85--117 (2016; Zbl 1387.90141) Full Text: DOI
Sinnl, Markus; Ljubić, Ivana A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints. (English) Zbl 1391.90421 Math. Program. Comput. 8, No. 4, 461-490 (2016). MSC: 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{M. Sinnl} and \textit{I. Ljubić}, Math. Program. Comput. 8, No. 4, 461--490 (2016; Zbl 1391.90421) Full Text: DOI
Leitner, Markus Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem. (English) Zbl 1349.90636 Comput. Oper. Res. 65, 1-18 (2016). MSC: 90C10 90B18 90C57 PDFBibTeX XMLCite \textit{M. Leitner}, Comput. Oper. Res. 65, 1--18 (2016; Zbl 1349.90636) Full Text: DOI
Bicalho, Luis Henrique; da Cunha, Alexandre Salles; Lucena, Abilio Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem. (English) Zbl 1343.90101 Comput. Optim. Appl. 63, No. 3, 755-792 (2016). MSC: 90C35 90C57 PDFBibTeX XMLCite \textit{L. H. Bicalho} et al., Comput. Optim. Appl. 63, No. 3, 755--792 (2016; Zbl 1343.90101) Full Text: DOI
Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F. An exact combinatorial algorithm for minimum graph bisection. (English) Zbl 1327.90255 Math. Program. 153, No. 2 (A), 417-458 (2015). MSC: 90C27 90C35 90C57 05C85 PDFBibTeX XMLCite \textit{D. Delling} et al., Math. Program. 153, No. 2 (A), 417--458 (2015; Zbl 1327.90255) Full Text: DOI Link
Amaldi, Edoardo; Coniglio, Stefano; Gualandi, Stefano Coordinated cutting plane generation via multi-objective separation. (English) Zbl 1286.90094 Math. Program. 143, No. 1-2 (A), 87-110 (2014). MSC: 90C10 90C29 90C57 PDFBibTeX XMLCite \textit{E. Amaldi} et al., Math. Program. 143, No. 1--2 (A), 87--110 (2014; Zbl 1286.90094) Full Text: DOI
Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. (English) Zbl 1292.90165 Eur. J. Oper. Res. 225, No. 2, 211-222 (2013). MSC: 90B80 90C57 90B18 90B10 90C10 PDFBibTeX XMLCite \textit{S. Gollowitzer} et al., Eur. J. Oper. Res. 225, No. 2, 211--222 (2013; Zbl 1292.90165) Full Text: DOI
Borndörfer, Ralf; Karbstein, Marika; Pfetsch, Marc E. The Steiner connectivity problem. (English) Zbl 1282.90103 Math. Program. 142, No. 1-2 (A), 133-167 (2013). MSC: 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{R. Borndörfer} et al., Math. Program. 142, No. 1--2 (A), 133--167 (2013; Zbl 1282.90103) Full Text: DOI
Simonetti, Luidi; da Cunha, Alexandre Salles; Lucena, Abilio Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem. (English) Zbl 1282.90155 Math. Program. 142, No. 1-2 (A), 511-538 (2013). MSC: 90C27 90C35 90C57 PDFBibTeX XMLCite \textit{L. Simonetti} et al., Math. Program. 142, No. 1--2 (A), 511--538 (2013; Zbl 1282.90155) Full Text: DOI
Leggieri, V.; Haouari, M.; Triki, C. A branch-and-cut algorithm for the Steiner tree problem with delays. (English) Zbl 1257.90084 Optim. Lett. 6, No. 8, 1753-1771 (2012). MSC: 90C27 90C35 90C57 PDFBibTeX XMLCite \textit{V. Leggieri} et al., Optim. Lett. 6, No. 8, 1753--1771 (2012; Zbl 1257.90084) Full Text: DOI
Simonetti, L.; Frota, Y.; de Souza, C. C. The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm. (English) Zbl 1228.90137 Discrete Appl. Math. 159, No. 16, 1901-1914 (2011). MSC: 90C35 90C10 90C57 PDFBibTeX XMLCite \textit{L. Simonetti} et al., Discrete Appl. Math. 159, No. 16, 1901--1914 (2011; Zbl 1228.90137) Full Text: DOI
Gouveia, Luis; Simonetti, Luidi; Uchoa, Eduardo Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. (English) Zbl 1218.90201 Math. Program. 128, No. 1-2 (A), 123-148 (2011). MSC: 90C35 90C11 90C27 90C57 PDFBibTeX XMLCite \textit{L. Gouveia} et al., Math. Program. 128, No. 1--2 (A), 123--148 (2011; Zbl 1218.90201) Full Text: DOI
Gollowitzer, Stefan; Ljubić, Ivana MIP models for connected facility location: a theoretical and computational study. (English) Zbl 1231.90267 Comput. Oper. Res. 38, No. 2, 435-449 (2011). MSC: 90B80 90B10 90C11 90C57 PDFBibTeX XMLCite \textit{S. Gollowitzer} and \textit{I. Ljubić}, Comput. Oper. Res. 38, No. 2, 435--449 (2011; Zbl 1231.90267) Full Text: DOI
Martinez, Leonardo Conegundes; Da Cunha, Alexandre Salles Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm. (English) Zbl 1237.90206 Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 311-318 (2010). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{L. C. Martinez} and \textit{A. S. Da Cunha}, Electron. Notes Discrete Math. 36, 311--318 (2010; Zbl 1237.90206) Full Text: DOI
Lucena, Abilio; Maculan, Nelson; Simonetti, Luidi Reformulations and solution algorithms for the maximum leaf spanning tree problem. (English) Zbl 1198.90380 Comput. Manag. Sci. 7, No. 3, 289-311 (2010). MSC: 90C35 90C57 90C60 PDFBibTeX XMLCite \textit{A. Lucena} et al., Comput. Manag. Sci. 7, No. 3, 289--311 (2010; Zbl 1198.90380) Full Text: DOI
Chimani, Markus; Kandyba, Maria; Ljubić, Ivana; Mutzel, Petra Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice. (English) Zbl 1198.90335 Math. Program. 124, No. 1-2 (B), 413-439 (2010). MSC: 90C27 90C57 90C90 PDFBibTeX XMLCite \textit{M. Chimani} et al., Math. Program. 124, No. 1--2 (B), 413--439 (2010; Zbl 1198.90335) Full Text: DOI
Obreque, Carlos; Donoso, Macarena; Gutiérrez, Gabriel; Marianov, Vladimir A branch and cut algorithm for the hierarchical network design problem. (English) Zbl 1188.90051 Eur. J. Oper. Res. 200, No. 1, 28-35 (2010). MSC: 90B10 90C57 PDFBibTeX XMLCite \textit{C. Obreque} et al., Eur. J. Oper. Res. 200, No. 1, 28--35 (2010; Zbl 1188.90051) Full Text: DOI Link
Ferreira, Carlos Eduardo; de Oliveira Filho, Fernando M. New reduction techniques for the group Steiner tree problem. (English) Zbl 1136.90032 SIAM J. Optim. 17, No. 4, 1176-1188 (2006). MSC: 90C27 90C35 90C57 PDFBibTeX XMLCite \textit{C. E. Ferreira} and \textit{F. M. de Oliveira Filho}, SIAM J. Optim. 17, No. 4, 1176--1188 (2006; Zbl 1136.90032) Full Text: DOI
Barahona, Francisco; Ladányi, László Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut. (English) Zbl 1146.90090 RAIRO, Oper. Res. 40, No. 1, 53-73 (2006). Reviewer: Paolo Nobili (Lecce) MSC: 90C57 90C27 90C35 PDFBibTeX XMLCite \textit{F. Barahona} and \textit{L. Ladányi}, RAIRO, Oper. Res. 40, No. 1, 53--73 (2006; Zbl 1146.90090) Full Text: DOI Numdam EuDML
Ljubić, Ivana; Weiskircher, René; Pferschy, Ulrich; Klau, Gunnar W.; Mutzel, Petra; Fischetti, Matteo An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. (English) Zbl 1085.90061 Math. Program. 105, No. 2-3 (B), 427-449 (2006). MSC: 90C57 90B10 05C05 PDFBibTeX XMLCite \textit{I. Ljubić} et al., Math. Program. 105, No. 2--3 (B), 427--449 (2006; Zbl 1085.90061) Full Text: DOI
Möller, Markus Mixed integer models for the optimisation of gas networks in the stationary case. (English) Zbl 1069.90120 Darmstadt: Univ. Darmstadt, Fachbereich Mathematik (Diss. 2004). 162 p. (2004). Reviewer: Lubomír Bakule (Praha) MSC: 90C90 90B10 90C11 93A15 93A30 90C57 PDFBibTeX XMLCite \textit{M. Möller}, Mixed integer models for the optimisation of gas networks in the stationary case. Darmstadt: Univ. Darmstadt, Fachbereich Mathematik (Diss. 2004) (2004; Zbl 1069.90120) Full Text: Link