Blum, Christian; Pinacho-Davidson, Pedro Application of negative learning ant colony optimization to the far from most string problem. (English) Zbl 07787615 Pérez Cáceres, Leslie (ed.) et al., Evolutionary computation in combinatorial optimization. 23rd European conference, EvoCOP 2023, held as part of EvoStar 2023, Brno, Czech Republic, April 12–14, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13987, 82-97 (2023). MSC: 68W50 90C27 90C59 PDFBibTeX XMLCite \textit{C. Blum} and \textit{P. Pinacho-Davidson}, Lect. Notes Comput. Sci. 13987, 82--97 (2023; Zbl 07787615) Full Text: DOI
Blum, Christian (ed.); Eftimov, Tome (ed.); Korošec, Peter (ed.) Preface. Special issue on “Understanding of evolutionary optimization behavior”. II. (English) Zbl 07733303 Nat. Comput. 21, No. 2, 127-130 (2022). MSC: 68-06 68T20 68W50 90C59 00B15 PDFBibTeX XMLCite \textit{C. Blum} (ed.) et al., Nat. Comput. 21, No. 2, 127--130 (2022; Zbl 07733303) Full Text: DOI
Blum, Christian (ed.); Eftimov, Tome (ed.); Korošec, Peter (ed.) Preface. Special issue on “Understanding of evolutionary optimization behavior”. I. (English) Zbl 07735494 Nat. Comput. 20, No. 3, 341-344 (2021). MSC: 68-06 68T20 68W50 90C59 00B15 PDFBibTeX XMLCite \textit{C. Blum} (ed.) et al., Nat. Comput. 20, No. 3, 341--344 (2021; Zbl 07735494) Full Text: DOI
Blum, Christian; Djukanovic, Marko; Santini, Alberto; Jiang, Hua; Li, Chu-Min; Manyà, Felip; Raidl, Günter R. Solving longest common subsequence problems via a transformation to the maximum clique problem. (English) Zbl 1458.68288 Comput. Oper. Res. 125, Article ID 105089, 17 p. (2021). MSC: 68W32 68Q25 90C35 90C59 PDFBibTeX XMLCite \textit{C. Blum} et al., Comput. Oper. Res. 125, Article ID 105089, 17 p. (2021; Zbl 1458.68288) Full Text: DOI
Djukanovic, Marko; Raidl, Günther R.; Blum, Christian Anytime algorithms for the longest common palindromic subsequence problem. (English) Zbl 1458.68289 Comput. Oper. Res. 114, Article ID 104827, 20 p. (2020). MSC: 68W32 68Q25 68R15 68W05 90C59 PDFBibTeX XMLCite \textit{M. Djukanovic} et al., Comput. Oper. Res. 114, Article ID 104827, 20 p. (2020; Zbl 1458.68289) Full Text: DOI
Horn, Matthias; Raidl, Günther; Blum, Christian Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm. (English) Zbl 1478.90040 Artif. Intell. 277, Article ID 103173, 26 p. (2019). MSC: 90B35 68Q17 68T20 PDFBibTeX XMLCite \textit{M. Horn} et al., Artif. Intell. 277, Article ID 103173, 26 p. (2019; Zbl 1478.90040) Full Text: DOI Link
Blum, Christian; Blesa, Maria J. Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem. (English) Zbl 1519.68322 Chicano, Francisco (ed.) et al., Evolutionary computation in combinatorial optimization. 16th European conference, EvoCOP 2016, Porto, Portugal, March 30 – April 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9595, 46-57 (2016). MSC: 68W32 90C27 90C59 PDFBibTeX XMLCite \textit{C. Blum} and \textit{M. J. Blesa}, Lect. Notes Comput. Sci. 9595, 46--57 (2016; Zbl 1519.68322) Full Text: DOI Link
García-Martínez, C.; Blum, C.; Rodriguez, F. J.; Lozano, M. The firefighter problem: empirical results on random graphs. (English) Zbl 1348.05190 Comput. Oper. Res. 60, 55-66 (2015). MSC: 05C80 90C10 90C35 90C59 PDFBibTeX XMLCite \textit{C. García-Martínez} et al., Comput. Oper. Res. 60, 55--66 (2015; Zbl 1348.05190) Full Text: DOI
Pérez, Aritz; Blum, Christian; Lozano, Jose A. Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming. (English) Zbl 1443.68152 van der Gaag, Linda C. (ed.) et al., Probabilistic graphical models. 7th European workshop, PGM 2014, Utrecht, The Netherlands, September 17–19, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8754, 396-408 (2014). MSC: 68T05 05C22 05C69 62H22 68Q17 90C10 PDFBibTeX XMLCite \textit{A. Pérez} et al., Lect. Notes Comput. Sci. 8754, 396--408 (2014; Zbl 1443.68152) Full Text: DOI
Rodriguez, F. J.; Blum, C.; García-Martínez, C.; Lozano, M. GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times. (English) Zbl 1260.90096 Ann. Oper. Res. 201, 383–401 (2012). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{F. J. Rodriguez} et al., Ann. Oper. Res. 201, 383--401 (2012; Zbl 1260.90096) Full Text: DOI
Rodriguez, Francisco J.; Blum, Christian; Lozano, Manuel; García-Martínez, Carlos Iterated greedy algorithms for the maximal covering location problem. (English) Zbl 1292.90173 Hao, Jin-Kao (ed.) et al., Evolutionary computation in combinatorial optimization. 12th European conference, EvoCOP 2012, Málaga, Spain, April 11–13, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29123-4/pbk). Lecture Notes in Computer Science 7245, 172-181 (2012). MSC: 90B80 90C59 PDFBibTeX XML Full Text: DOI
Blum, Christian; Puchinger, Jakob; Raidl, Günther; Roli, Andrea Hybrid metaheuristics. (English) Zbl 1205.90298 Milano, Michela (ed.) et al., Hybrid optimization. The ten years of CPAIOR. New York, NY: Springer (ISBN 978-1-4419-1643-3/hbk; 978-1-4419-1644-0/ebook). Springer Optimization and Its Applications 45, 305-335 (2011). MSC: 90C59 68T20 PDFBibTeX XMLCite \textit{C. Blum} et al., Springer Optim. Appl. 45, 305--335 (2011; Zbl 1205.90298) Full Text: DOI
Blesa, María J. (ed.); Blum, Christian (ed.); Raidl, Günther (ed.); Roli, Andrea (ed.); Sampels, Michael (ed.) Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1–2, 2010. Proceedings. (English) Zbl 1196.68002 Lecture Notes in Computer Science 6373. Berlin: Springer (ISBN 978-3-642-16053-0/pbk). x, 223 p. (2010). MSC: 68-06 90-06 68T20 90C59 00B25 PDFBibTeX XMLCite \textit{M. J. Blesa} (ed.) et al., Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings. Berlin: Springer (2010; Zbl 1196.68002) Full Text: DOI
López-Ibáñez, Manuel; Blum, Christian Beam-ACO for the travelling salesman problem with time windows. (English) Zbl 1190.90165 Comput. Oper. Res. 37, No. 9, 1570-1583 (2010). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. López-Ibáñez} and \textit{C. Blum}, Comput. Oper. Res. 37, No. 9, 1570--1583 (2010; Zbl 1190.90165) Full Text: DOI Link
Blesa, María J. (ed.); Blum, Christian (ed.); Di Gaspero, Luca (ed.); Roli, Andrea (ed.); Sampels, Michael (ed.); Schaerf, Andrea (ed.) Hybrid metaheuristics. 6th international workshop, HM 2009, Udine, Italy, October 16–17, 2009. Proceedings. (English) Zbl 1176.68003 Lecture Notes in Computer Science 5818. Berlin: Springer (ISBN 978-3-642-04917-0/pbk). x, 179 p. (2009). MSC: 68-06 90-06 68T20 90C59 00B25 PDFBibTeX XMLCite \textit{M. J. Blesa} (ed.) et al., Hybrid metaheuristics. 6th international workshop, HM 2009, Udine, Italy, October 16--17, 2009. Proceedings. Berlin: Springer (2009; Zbl 1176.68003) Full Text: DOI
Blum, Christian; Blesa, Maria J.; López-Ibáñez, Manuel Beam search for the longest common subsequence problem. (English) Zbl 1175.90208 Comput. Oper. Res. 36, No. 12, 3178-3186 (2009). MSC: 90B40 90C59 PDFBibTeX XMLCite \textit{C. Blum} et al., Comput. Oper. Res. 36, No. 12, 3178--3186 (2009; Zbl 1175.90208) Full Text: DOI Link
Blesa, María J. (ed.); Blum, Christian (ed.); Cotta, Carlos (ed.); Fernández, Antonio J. (ed.); Gallardo, José E. (ed.); Roli, Andrea (ed.); Sampels, Michael (ed.) Hybrid metaheuristics. 5th international workshop, HM 2008, Málaga, Spain, October 8–9, 2008. Proceedings. (English) Zbl 1148.68301 Lecture Notes in Computer Science 5296. Berlin: Springer (ISBN 978-3-540-88438-5/pbk). x, 203 p. (2008). MSC: 68-06 90-06 68T20 90C59 00B25 PDFBibTeX XMLCite \textit{M. J. Blesa} (ed.) et al., Hybrid metaheuristics. 5th international workshop, HM 2008, Málaga, Spain, October 8--9, 2008. Proceedings. Berlin: Springer (2008; Zbl 1148.68301) Full Text: DOI
Bartz-Beielstein, Thomas (ed.); Blesa Aguilera, María José (ed.); Blum, Christian (ed.); Naujoks, Boris (ed.); Roli, Andrea (ed.); Rudolph, Günter (ed.); Sampels, Michael (ed.) Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8–9, 2007. Proceedings. (English) Zbl 1147.68303 Lecture Notes in Computer Science 4771. Berlin: Springer (ISBN 978-3-540-75513-5/pbk). x, 201 p. (2007). MSC: 68-06 90-06 68T20 90C59 00B25 PDFBibTeX XMLCite \textit{T. Bartz-Beielstein} (ed.) et al., Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings. Berlin: Springer (2007; Zbl 1147.68303) Full Text: DOI
Blesa, Maria J.; Blum, Christian Finding edge-disjoint paths in networks: an ant colony optimization algorithm. (English) Zbl 1149.90031 J. Math. Model. Algorithms 6, No. 3, 361-391 (2007). MSC: 90B18 90C59 68T20 68W25 PDFBibTeX XMLCite \textit{M. J. Blesa} and \textit{C. Blum}, J. Math. Model. Algorithms 6, No. 3, 361--391 (2007; Zbl 1149.90031) Full Text: DOI
Almeida, Francisco (ed.); Blesa Aguilera, María J. (ed.); Blum, Christian (ed.); Moreno Vega, José Marcos (ed.); Pérez Pérez, Melquíades (ed.); Roli, Andrea (ed.); Sampels, Michael (ed.) Hybrid metaheuristics. Third international workshop, HM 2006, Gran Canaria, Spain, October 13–15, 2006. Proceedings. (English) Zbl 1146.68301 Lecture Notes in Computer Science 4030. Berlin: Springer (ISBN 978-3-540-46384-9/pbk). x, 193 p. (2006). MSC: 68-06 90-06 68T20 90C59 00B25 PDFBibTeX XMLCite \textit{F. Almeida} (ed.) et al., Hybrid metaheuristics. Third international workshop, HM 2006, Gran Canaria, Spain, October 13--15, 2006. Proceedings. Berlin: Springer (2006; Zbl 1146.68301)
Blesa, María J. (ed.); Blum, Christian (ed.); Roli, Andrea (ed.); Sampels, Michael (ed.) Hybrid metaheuristics. Second international workshop, HM 2005, Barcelona, Spain, August 29–30, 2005. Proceedings. (English) Zbl 1145.68300 Lecture Notes in Computer Science 3636. Berlin: Springer (ISBN 978-3-540-28535-9/pbk). xii, 155 p. (2005). MSC: 68-06 90-06 68T20 90C59 00B25 PDFBibTeX XMLCite \textit{M. J. Blesa} (ed.) et al., Hybrid metaheuristics. Second international workshop, HM 2005, Barcelona, Spain, August 29--30, 2005. Proceedings. Berlin: Springer (2005; Zbl 1145.68300) Full Text: DOI
Blum, Christian; Blesa, Maria J. New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem. (English) Zbl 1107.90044 Comput. Oper. Res. 32, No. 6, 1355-1377 (2004). MSC: 90C59 90C27 PDFBibTeX XMLCite \textit{C. Blum} and \textit{M. J. Blesa}, Comput. Oper. Res. 32, No. 6, 1355--1377 (2004; Zbl 1107.90044) Full Text: DOI