Baldomero-Naranjo, Marta; Kalcsics, Jörg; Marín, Alfredo; Rodríguez-Chía, Antonio M. Upgrading edges in the maximal covering location problem. (English) Zbl 1507.90086 Eur. J. Oper. Res. 303, No. 1, 14-36 (2022). MSC: 90B80 90B10 90C11 90C35 PDFBibTeX XMLCite \textit{M. Baldomero-Naranjo} et al., Eur. J. Oper. Res. 303, No. 1, 14--36 (2022; Zbl 1507.90086) Full Text: DOI
Nguyen, Viet Hung; Minoux, Michel Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results. (English) Zbl 1471.90158 Optim. Lett. 15, No. 4, 1041-1060 (2021). MSC: 90C35 90C11 90C57 PDFBibTeX XMLCite \textit{V. H. Nguyen} and \textit{M. Minoux}, Optim. Lett. 15, No. 4, 1041--1060 (2021; Zbl 1471.90158) Full Text: DOI HAL
Ghanbartehrani, Saeed; Porter, J. David An efficient algorithm for solving the median problem on real road networks. (English) Zbl 1523.90253 Eng. Optim. 52, No. 6, 973-986 (2020). MSC: 90B80 90B10 90C35 PDFBibTeX XMLCite \textit{S. Ghanbartehrani} and \textit{J. D. Porter}, Eng. Optim. 52, No. 6, 973--986 (2020; Zbl 1523.90253) Full Text: DOI
Arulselvan, Ashwin; Bley, Andreas; Ljubić, Ivana The incremental connected facility location problem. (English) Zbl 1458.90409 Comput. Oper. Res. 112, Article ID 104763, 17 p. (2019). MSC: 90B80 90B10 90C11 90C27 90C35 90C57 PDFBibTeX XMLCite \textit{A. Arulselvan} et al., Comput. Oper. Res. 112, Article ID 104763, 17 p. (2019; Zbl 1458.90409) Full Text: DOI Link
Filippi, Carlo; Ogryczak, Włodzimierz; Speranza, M. Grazia Bridging \(k\)-sum and CVaR optimization in MILP. (English) Zbl 1458.90483 Comput. Oper. Res. 105, 156-166 (2019). MSC: 90C11 90C05 90C15 90C27 90C35 PDFBibTeX XMLCite \textit{C. Filippi} et al., Comput. Oper. Res. 105, 156--166 (2019; Zbl 1458.90483) Full Text: DOI
Yıldız, Barış; Karaşan, Oya Ekin; Yaman, Hande Branch-and-price approaches for the network design problem with relays. (English) Zbl 1391.90624 Comput. Oper. Res. 92, 155-169 (2018). MSC: 90C35 90B18 90C57 90B80 90C10 PDFBibTeX XMLCite \textit{B. Yıldız} et al., Comput. Oper. Res. 92, 155--169 (2018; Zbl 1391.90624) Full Text: DOI Link
Fonseca-Reyna, Yunior César; Martínez-Jiménez, Yailen; Nowé, Ann Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan. (English) Zbl 1471.90157 Rev. Invest. Oper. 38, No. 3, 281-290 (2017). MSC: 90C35 90C59 68T05 PDFBibTeX XMLCite \textit{Y. C. Fonseca-Reyna} et al., Rev. Invest. Oper. 38, No. 3, 281--290 (2017; Zbl 1471.90157) Full Text: Link
Calik, Hatice; Leitner, Markus; Luipersbeck, Martin A Benders decomposition based framework for solving cable trench problems. (English) Zbl 1391.90505 Comput. Oper. Res. 81, 128-140 (2017). MSC: 90C27 90C35 90C11 90C57 90B10 90B80 PDFBibTeX XMLCite \textit{H. Calik} et al., Comput. Oper. Res. 81, 128--140 (2017; Zbl 1391.90505) Full Text: DOI HAL
Assunção, Lucas; Noronha, Thiago F.; Santos, Andréa Cynthia; Andrade, Rafael A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. (English) Zbl 1391.90504 Comput. Oper. Res. 81, 51-66 (2017). MSC: 90C27 90C59 90C35 90C11 PDFBibTeX XMLCite \textit{L. Assunção} et al., Comput. Oper. Res. 81, 51--66 (2017; Zbl 1391.90504) Full Text: DOI arXiv
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
Albareda-Sambola, Maria; Landete, Mercedes; Monge, Juan F.; Sainz-Pardo, José L. Introducing capacities in the location of unreliable facilities. (English) Zbl 1394.90382 Eur. J. Oper. Res. 259, No. 1, 175-188 (2017). MSC: 90B80 90B30 90B25 90C10 90C35 05C85 PDFBibTeX XMLCite \textit{M. Albareda-Sambola} et al., Eur. J. Oper. Res. 259, No. 1, 175--188 (2017; Zbl 1394.90382) Full Text: DOI Link
Nikolaev, Alexey; Mladenović, Nenad; Todosijević, Raca J-means and I-means for minimum sum-of-squares clustering on networks. (English) Zbl 1369.90180 Optim. Lett. 11, No. 2, 359-376 (2017). MSC: 90C35 90C11 90C59 PDFBibTeX XMLCite \textit{A. Nikolaev} et al., Optim. Lett. 11, No. 2, 359--376 (2017; Zbl 1369.90180) Full Text: DOI
Cheng, Jianqiang; Leung, Janny; Lisser, Abdel New reformulations of distributionally robust shortest path problem. (English) Zbl 1349.90808 Comput. Oper. Res. 74, 196-204 (2016). MSC: 90C35 90C15 90C22 PDFBibTeX XMLCite \textit{J. Cheng} et al., Comput. Oper. Res. 74, 196--204 (2016; Zbl 1349.90808) 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
Fu, Zhang-Hua; Hao, Jin-Kao Dynamic programming driven memetic search for the Steiner tree problem with revenues, budget, and hop constraints. (English) Zbl 1329.90150 INFORMS J. Comput. 27, No. 2, 221-237 (2015). MSC: 90C35 90C39 90C90 PDFBibTeX XMLCite \textit{Z.-H. Fu} and \textit{J.-K. Hao}, INFORMS J. Comput. 27, No. 2, 221--237 (2015; Zbl 1329.90150) Full Text: DOI
Monteiro, Marta S. R.; Fontes, Dalila B. M. M.; Fontes, Fernando A. C. C. The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach. (English) Zbl 1317.90307 Optim. Lett. 9, No. 3, 451-464 (2015). MSC: 90C35 90C27 90C59 PDFBibTeX XMLCite \textit{M. S. R. Monteiro} et al., Optim. Lett. 9, No. 3, 451--464 (2015; Zbl 1317.90307) Full Text: DOI Link
Fu, Zhang-Hua; Hao, Jin-Kao Breakout local search for the Steiner tree problem with revenue, budget and hop constraints. (English) Zbl 1305.90348 Eur. J. Oper. Res. 232, No. 1, 209-220 (2014). MSC: 90C27 90C59 90C35 90B10 PDFBibTeX XMLCite \textit{Z.-H. Fu} and \textit{J.-K. Hao}, Eur. J. Oper. Res. 232, No. 1, 209--220 (2014; Zbl 1305.90348) Full Text: DOI
Parvaresh, F.; Golpayegany, S. A. Hashemi; Husseini, S. M. Moattar; Karimi, B. Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing. (English) Zbl 1332.90140 Netw. Spat. Econ. 13, No. 4, 445-470 (2013). MSC: 90B80 90C11 91A65 90C35 PDFBibTeX XMLCite \textit{F. Parvaresh} et al., Netw. Spat. Econ. 13, No. 4, 445--470 (2013; Zbl 1332.90140) Full Text: DOI
Carrizosa, Emilio; Mladenović, Nenad; Todosijević, Raca Variable neighborhood search for minimum sum-of-squares clustering on networks. (English) Zbl 1317.91061 Eur. J. Oper. Res. 230, No. 2, 356-363 (2013). MSC: 91C20 90C35 PDFBibTeX XMLCite \textit{E. Carrizosa} et al., Eur. J. Oper. Res. 230, No. 2, 356--363 (2013; Zbl 1317.91061) Full Text: DOI Link
Song, Yongjia; Luedtke, James R. Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. (English) Zbl 1330.90057 Math. Program. Comput. 5, No. 4, 397-432 (2013). MSC: 90C11 90C15 90C35 90C57 PDFBibTeX XMLCite \textit{Y. Song} and \textit{J. R. Luedtke}, Math. Program. Comput. 5, No. 4, 397--432 (2013; Zbl 1330.90057) 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
Fontes, Dalila B. M. M.; Gonçalves, José Fernando A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks. (English) Zbl 1276.90077 Optim. Lett. 7, No. 6, 1303-1324 (2013). MSC: 90C35 90C59 90B18 PDFBibTeX XMLCite \textit{D. B. M. M. Fontes} and \textit{J. F. Gonçalves}, Optim. Lett. 7, No. 6, 1303--1324 (2013; Zbl 1276.90077) Full Text: DOI Link
Pham, Quang Dung; Deville, Yves; van Hentenryck, Pascal LS(graph): a constraint-based local search for constraint optimization on trees and paths. (English) Zbl 1309.90089 Constraints 17, No. 4, 357-408 (2012). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{Q. D. Pham} et al., Constraints 17, No. 4, 357--408 (2012; Zbl 1309.90089) Full Text: DOI
Mladenović, Nenad; Kratica, Jozef; Kovačević-Vujčić, Vera; Čangalović, Mirjana Variable neighborhood search for metric dimension and minimal doubly resolving set problems. (English) Zbl 1253.90199 Eur. J. Oper. Res. 220, No. 2, 328-337 (2012). MSC: 90C27 90C59 05C12 90C35 PDFBibTeX XMLCite \textit{N. Mladenović} et al., Eur. J. Oper. Res. 220, No. 2, 328--337 (2012; Zbl 1253.90199) Full Text: DOI
Marianov, Vladimir; Gutiérrez-Jarpa, Gabriel; Obreque, Carlos; Cornejo, Oscar Lagrangean relaxation heuristics for the \(p\)-cable-trench problem. (English) Zbl 1251.90248 Comput. Oper. Res. 39, No. 3, 620-628 (2012). MSC: 90B80 90C27 90C35 PDFBibTeX XMLCite \textit{V. Marianov} et al., Comput. Oper. Res. 39, No. 3, 620--628 (2012; Zbl 1251.90248) Full Text: DOI
Goldengorin, Boris; Krushinsky, Dmitry A computational study of the pseudo-Boolean approach to the \(p\)-median problem applied to cell formation. (English) Zbl 1346.90494 Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 503-516 (2011). MSC: 90B80 90-08 90C35 PDFBibTeX XMLCite \textit{B. Goldengorin} and \textit{D. Krushinsky}, Lect. Notes Comput. Sci. 6701, 503--516 (2011; Zbl 1346.90494) Full Text: DOI
Arulselvan, Ashwin; Bley, Andreas; Gollowitzer, Stefan; Ljubić, Ivana; Maurer, Olaf MIP modeling of incremental connected facility location. (English) Zbl 1346.90478 Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 490-502 (2011). MSC: 90B80 90C35 PDFBibTeX XMLCite \textit{A. Arulselvan} et al., Lect. Notes Comput. Sci. 6701, 490--502 (2011; Zbl 1346.90478) Full Text: DOI
Pham, Quang Dung; Deville, Yves; Van Hentenryck, Pascal Constraint-based local search for constrained optimum paths problems. (English) Zbl 1285.68160 Lodi, Andrea (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 7th international conference, CPAIOR 2010, Bologna, Italy, June 14–18, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13519-4/pbk). Lecture Notes in Computer Science 6140, 267-281 (2010). MSC: 68T20 90C27 90C35 PDFBibTeX XMLCite \textit{Q. D. Pham} et al., Lect. Notes Comput. Sci. 6140, 267--281 (2010; Zbl 1285.68160) Full Text: DOI
Lucena, Abilio; Ribeiro, Celso C.; Santos, Andréa C. A hybrid heuristic for the diameter constrained minimum spanning tree problem. (English) Zbl 1187.90306 J. Glob. Optim. 46, No. 3, 363-381 (2010). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{A. Lucena} et al., J. Glob. Optim. 46, No. 3, 363--381 (2010; Zbl 1187.90306) Full Text: DOI
Costa, Alysson M.; Cordeau, Jean-François; Laporte, Gilbert Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. (English) Zbl 1180.90348 Networks 53, No. 2, 141-159 (2009). MSC: 90C35 90C57 68R10 PDFBibTeX XMLCite \textit{A. M. Costa} et al., Networks 53, No. 2, 141--159 (2009; Zbl 1180.90348) Full Text: DOI
Berman, Oded; Drezner, Zvi; Krass, Dmitry; Wesolowsky, George O. The variable radius covering problem. (English) Zbl 1163.90590 Eur. J. Oper. Res. 196, No. 2, 516-525 (2009). MSC: 90B80 90B50 90C35 90C39 PDFBibTeX XMLCite \textit{O. Berman} et al., Eur. J. Oper. Res. 196, No. 2, 516--525 (2009; Zbl 1163.90590) Full Text: DOI
Aboolian, Robert; Berman, Oded; Drezner, Zvi The multiple server center location problem. (English) Zbl 1163.90580 Ann. Oper. Res. 167, 337-352 (2009). MSC: 90B80 90C35 PDFBibTeX XMLCite \textit{R. Aboolian} et al., Ann. Oper. Res. 167, 337--352 (2009; Zbl 1163.90580) Full Text: DOI
Berman, Oded; Drezner, Zvi; Tamir, Arie; Wesolowsky, George O. Optimal location with equitable loads. (English) Zbl 1163.90591 Ann. Oper. Res. 167, 307-325 (2009). MSC: 90B80 90B06 90C35 90B10 PDFBibTeX XMLCite \textit{O. Berman} et al., Ann. Oper. Res. 167, 307--325 (2009; Zbl 1163.90591) Full Text: DOI
da Cunha, Alexandre Salles; Lucena, Abilio; Maculan, Nelson; Resende, Mauricio G. C. A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. (English) Zbl 1173.90573 Discrete Appl. Math. 157, No. 6, 1198-1217 (2009). MSC: 90C35 05C05 PDFBibTeX XMLCite \textit{A. S. da Cunha} et al., Discrete Appl. Math. 157, No. 6, 1198--1217 (2009; Zbl 1173.90573) Full Text: DOI
Berman, O.; Drezner, T.; Drezner, Z.; Wesolowsky, G. O. A defensive maximal covering problem on a network. (English) Zbl 1153.90332 Int. Trans. Oper. Res. 16, No. 1, 69-86 (2009). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{O. Berman} et al., Int. Trans. Oper. Res. 16, No. 1, 69--86 (2009; Zbl 1153.90332) Full Text: DOI
Fontes, Dalila B. M. M.; Gonçalves, José Fernando Heuristic solutions for general concave minimum cost network flow problems. (English) Zbl 1119.90067 Networks 50, No. 1, 67-76 (2007). MSC: 90C35 90C59 90C27 90B10 PDFBibTeX XMLCite \textit{D. B. M. M. Fontes} and \textit{J. F. Gonçalves}, Networks 50, No. 1, 67--76 (2007; Zbl 1119.90067) Full Text: DOI
Avella, Pasquale; Sassano, Antonio; Vasil’ev, Igor Computational study of large-scale \(p\)-median problems. (English) Zbl 1275.90112 Math. Program. 109, No. 1 (A), 89-114 (2007). MSC: 90C35 90C57 PDFBibTeX XMLCite \textit{P. Avella} et al., Math. Program. 109, No. 1 (A), 89--114 (2007; Zbl 1275.90112) Full Text: DOI
Cornuéjols, Gérard; Karamanov, Miroslav; Li, Yanjun Early estimates of the size of branch-and-bound trees. (English) Zbl 1241.90090 INFORMS J. Comput. 18, No. 1, 86-96 (2006). MSC: 90C11 90C10 90C57 90C35 PDFBibTeX XMLCite \textit{G. Cornuéjols} et al., INFORMS J. Comput. 18, No. 1, 86--96 (2006; Zbl 1241.90090) Full Text: DOI
Fathali, Jafar A genetic algorithm for the \(p\)-median problem with pos/neg weights. (English) Zbl 1105.65066 Appl. Math. Comput. 183, No. 2, 1071-1083 (2006). MSC: 65K05 90C35 PDFBibTeX XMLCite \textit{J. Fathali}, Appl. Math. Comput. 183, No. 2, 1071--1083 (2006; Zbl 1105.65066) Full Text: DOI
Fontes, Dalila B. M. M.; Hadjiconstantinou, Eleni; Christofides, Nicos A branch-and-bound algorithm for concave network flow problems. (English) Zbl 1098.90080 J. Glob. Optim. 34, No. 1, 127-155 (2006). MSC: 90C35 90B10 90C39 90C57 PDFBibTeX XMLCite \textit{D. B. M. M. Fontes} et al., J. Glob. Optim. 34, No. 1, 127--155 (2006; Zbl 1098.90080) Full Text: DOI
Fontes, Dalila B. M. M.; Hadjiconstantinou, Eleni; Christofides, Nicos Lower bounds from state space relaxations for concave cost network flow problems. (English) Zbl 1098.90079 J. Glob. Optim. 34, No. 1, 97-125 (2006). MSC: 90C35 90B10 90C39 90C57 PDFBibTeX XMLCite \textit{D. B. M. M. Fontes} et al., J. Glob. Optim. 34, No. 1, 97--125 (2006; Zbl 1098.90079) Full Text: DOI
Beasley, J. E.; Meade, N.; Chang, T.-J. An evolutionary heuristic for the index tracking problem. (English) Zbl 1037.90038 Eur. J. Oper. Res. 148, No. 3, 621-643 (2003). MSC: 90B50 90C59 90C35 91B28 PDFBibTeX XMLCite \textit{J. E. Beasley} et al., Eur. J. Oper. Res. 148, No. 3, 621--643 (2003; Zbl 1037.90038) Full Text: DOI
Ribeiro, Celso C.; Uchoa, Eduardo; Werneck, Renato F. A hybrid GRASP with perturbations for the Steiner problem in graphs. (English) Zbl 1238.90117 INFORMS J. Comput. 14, No. 3, 228-246 (2002). MSC: 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{C. C. Ribeiro} et al., INFORMS J. Comput. 14, No. 3, 228--246 (2002; Zbl 1238.90117) Full Text: DOI Link
Fleszar, Krzysztof; Hindi, Khalil S. New heuristics for one-dimensional bin-packing. (English) Zbl 0994.90134 Comput. Oper. Res. 29, No. 7, 821-839 (2002). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{K. Fleszar} and \textit{K. S. Hindi}, Comput. Oper. Res. 29, No. 7, 821--839 (2002; Zbl 0994.90134) Full Text: DOI
Polzin, Tobias; Daneshmand, Siavash Vahdati Improved algorithms for the Steiner problem in networks. (English) Zbl 0994.90135 Discrete Appl. Math. 112, No. 1-3, 263-300 (2001). Reviewer: Ján Plesník (Bratislava) MSC: 90C35 05C85 PDFBibTeX XMLCite \textit{T. Polzin} and \textit{S. V. Daneshmand}, Discrete Appl. Math. 112, No. 1--3, 263--300 (2001; Zbl 0994.90135) Full Text: DOI
Wade, A. S. C.; Rayward-Smith, V. J. Effective local search techniques for the Steiner tree problem. (English) Zbl 0959.90055 Du, Ding-Zhu (ed.) et al., Advances in Steiner trees. Dordrecht: Kluwer Academic Publishers. Comb. Optim. 6, 255-281 (2000). MSC: 90C35 05C05 PDFBibTeX XMLCite \textit{A. S. C. Wade} and \textit{V. J. Rayward-Smith}, Comb. Optim. 6, 255--281 (2000; Zbl 0959.90055)
Warme, D. M.; Winter, P.; Zachariasen, M. Exact algorithms for plane Steiner tree problems: A computational study. (English) Zbl 0968.90067 Du, Ding-Zhu (ed.) et al., Advances in Steiner trees. Dordrecht: Kluwer Academic Publishers. Comb. Optim. 6, 81-116 (2000). MSC: 90C35 68W05 90C27 05C85 90C57 PDFBibTeX XMLCite \textit{D. M. Warme} et al., Comb. Optim. 6, 81--116 (2000; Zbl 0968.90067)
Verhoeven, M. G. A.; Severens, M. E. M. Parallel local search for Steiner trees in graphs. (English) Zbl 0937.90113 Ann. Oper. Res. 90, 185-202 (1999). MSC: 90C35 05C05 05C85 65Y05 PDFBibTeX XMLCite \textit{M. G. A. Verhoeven} and \textit{M. E. M. Severens}, Ann. Oper. Res. 90, 185--202 (1999; Zbl 0937.90113) Full Text: DOI
Zachariasen, Martin Local search for the Steiner tree problem in the Euclidean plane. (English) Zbl 0933.90065 Eur. J. Oper. Res. 119, No. 2, 282-300 (1999). MSC: 90C35 PDFBibTeX XMLCite \textit{M. Zachariasen}, Eur. J. Oper. Res. 119, No. 2, 282--300 (1999; Zbl 0933.90065) Full Text: DOI
Gendreau, Michel; Larochelle, Jean-Francois; Sansò, Brunilde A tabu search heuristic for the Steiner tree problem. (English) Zbl 0959.90059 Networks 34, No. 2, 162-172 (1999). MSC: 90C35 90B10 90B40 90C59 PDFBibTeX XMLCite \textit{M. Gendreau} et al., Networks 34, No. 2, 162--172 (1999; Zbl 0959.90059) Full Text: DOI
Martins, S. L.; Pardalos, P. M.; Resende, M. G. C.; Ribeiro, C. C. Greedy randomized adaptive search procedures for the Steiner problem in graphs. (English) Zbl 0912.68154 Pardalos, Panos (ed.) et al., Randomization methods in algorithm design. DIMACS workshop, Princeton Univ., NJ, USA, December 12–14, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 43, 133-145 (1999). MSC: 68R10 68P10 90C27 90B18 68R05 90C35 94C15 PDFBibTeX XMLCite \textit{S. L. Martins} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 43, 133--145 (1999; Zbl 0912.68154)
Harris, Frederick C. jun. Steiner minimal trees: An introduction, parallel computation, and future work. (English) Zbl 0932.90045 Du, Ding-Zhu (ed.) et al., Handbook of combinatorial optimization. Vol. 2. Boston: Kluwer Academic Publishers. 105-157 (1998). Reviewer: G.Schulz (Magdeburg) MSC: 90C35 05C05 05C35 90C59 PDFBibTeX XMLCite \textit{F. C. Harris jun.}, in: Handbook of combinatorial optimization. Vol. 2. Boston: Kluwer Academic Publishers. 105--157 (1998; Zbl 0932.90045)
Voß, Stefan; Gutenschwager, Kai A chunking based genetic algorithm for the Steiner tree problem in graphs. (English) Zbl 0902.90163 Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 335-355 (1998). MSC: 90C35 68T05 90C27 68T99 PDFBibTeX XMLCite \textit{S. Voß} and \textit{K. Gutenschwager}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 335--355 (1998; Zbl 0902.90163)
Beasley, J. E.; Christofides, N. Vehicle routing with a sparse feasibility graph. (English) Zbl 0930.90008 Eur. J. Oper. Res. 98, No. 3, 499-511 (1997). MSC: 90B06 90C35 90B10 PDFBibTeX XMLCite \textit{J. E. Beasley} and \textit{N. Christofides}, Eur. J. Oper. Res. 98, No. 3, 499--511 (1997; Zbl 0930.90008) Full Text: DOI
Duin, Cees; Voß, Stefan Efficient path and vertex exchange in Steiner tree algorithms. (English) Zbl 0888.90142 Networks 29, No. 2, 89-105 (1997). MSC: 90C35 PDFBibTeX XMLCite \textit{C. Duin} and \textit{S. Voß}, Networks 29, No. 2, 89--105 (1997; Zbl 0888.90142) Full Text: DOI
Reeves, Colin R. [Ahnja, Ravindra K.; Orlin, James B.; Kershenbaum, Aaron; Levine, David; Ross, Peter] Genetic algorithms for the operations researcher. (English) Zbl 0893.90145 INFORMS J. Comput. 9, No. 3, 231-250, commentaries 251-265 (1997). MSC: 90C27 68T05 90-02 90C35 90C10 PDFBibTeX XMLCite \textit{C. R. Reeves}, INFORMS J. Comput. 9, No. 3, 231--250, commentaries 251--265 (1997; Zbl 0893.90145) Full Text: DOI
Khoury, B. N.; Pardalos, P. M. A heuristic for the Steiner problem in graphs. (English) Zbl 0851.90126 Comput. Optim. Appl. 6, No. 1, 5-14 (1996). MSC: 90C35 PDFBibTeX XMLCite \textit{B. N. Khoury} and \textit{P. M. Pardalos}, Comput. Optim. Appl. 6, No. 1, 5--14 (1996; Zbl 0851.90126) Full Text: DOI
Esbensen, Henrik Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm. (English) Zbl 0856.90115 Networks 26, No. 4, 173-185 (1995). MSC: 90C35 68T05 PDFBibTeX XMLCite \textit{H. Esbensen}, Networks 26, No. 4, 173--185 (1995; Zbl 0856.90115) Full Text: DOI
Laporte, Gilbert; Osman, Ibrahim H. Routing problems: A bibliography. (English) Zbl 0839.90032 Ann. Oper. Res. 61, 227-262 (1995). MSC: 90B06 90C35 PDFBibTeX XMLCite \textit{G. Laporte} and \textit{I. H. Osman}, Ann. Oper. Res. 61, 227--262 (1995; Zbl 0839.90032) Full Text: DOI
Khoury, B. N.; Pardalos, P. M. An exact branch and bound algorithm for the Steiner problem in graphs. (English) Zbl 1527.68162 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 1st international conference, COCOON ’95, Xi’an, China, August 24–26, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 959, 582-590 (1995). MSC: 68R10 05C85 90C35 PDFBibTeX XMLCite \textit{B. N. Khoury} and \textit{P. M. Pardalos}, Lect. Notes Comput. Sci. 959, 582--590 (1995; Zbl 1527.68162) Full Text: DOI
Beasley, J. E.; Goffinet, F. A Delaunay triangulation-based heuristic for the Euclidean Steiner problem. (English) Zbl 0807.90115 Networks 24, No. 4, 215-224 (1994). MSC: 90C35 PDFBibTeX XMLCite \textit{J. E. Beasley} and \textit{F. Goffinet}, Networks 24, No. 4, 215--224 (1994; Zbl 0807.90115) Full Text: DOI
Beasley, J. E. A heuristic for Euclidean and rectilinear Steiner problems. (English) Zbl 0757.90080 Eur. J. Oper. Res. 58, No. 2, 284-292 (1992). MSC: 90C35 90-08 PDFBibTeX XMLCite \textit{J. E. Beasley}, Eur. J. Oper. Res. 58, No. 2, 284--292 (1992; Zbl 0757.90080) Full Text: DOI