<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Günther Raidl | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/guenther-raidl/</link><atom:link href="https://ac.tuwien.ac.at/team/guenther-raidl/index.xml" rel="self" type="application/rss+xml"/><description>Günther Raidl</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 05 Mar 2026 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/team/guenther-raidl/avatar_hu13863390279681552074.jpg</url><title>Günther Raidl</title><link>https://ac.tuwien.ac.at/team/guenther-raidl/</link></image><item><title>International and Organizational Activities</title><link>https://ac.tuwien.ac.at/team/international-and-organizational-activities/</link><pubDate>Thu, 05 Mar 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/team/international-and-organizational-activities/</guid><description>&lt;h2 id="günther-raidls-international-organizational-activities">Günther Raidl&amp;rsquo;s International Organizational Activities&lt;/h2>
&lt;p>This is an almost complete list of all my international organizational activities.&lt;/p>
&lt;ul>
&lt;li>Program committee member of the 14th International Conference on Swarm Intelligence (ANTS), Konstanz, Germany, October 2024.&lt;/li>
&lt;li>Program committee member of the Metaheuristics International Conference (MIC 2024), Lorient, France, June 2024.&lt;/li>
&lt;li>Reviewer for the University of Leuven for positions of research professors, December 2023.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2024 (EvoCOP 2024), Aberystwyth, Wales, April 2024.&lt;/li>
&lt;li>Reviewer for the journal IEEE Transaction on Evolutionary Computation (TEVC), August 2023.&lt;/li>
&lt;li>Reviewer for the journal Int. Transactions in Operational Research (ITOR), June 2023.&lt;/li>
&lt;li>Program committee member of the 9th International Conference on Machine Learning, Optimization, and Data Science (LOD), Grasmere, Lake District, England, September 2023.&lt;/li>
&lt;li>Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 19th International Conference on Computer Aided Systems Theory (EUROCAST), Gran Canaria, Spain, February 2024.&lt;/li>
&lt;li>Reviewer for the Slovenian Research and Innovation Agency (ARRS), May 2023.&lt;/li>
&lt;li>Reviewer for Deutsche Forschungsgemeinschaft (DFG), German Research Foundation), May 2023.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2023 (EvoCOP 2023), Brno, Czech Republic, April 2023.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2021 (EvoCOP 2022), Madrid, Spain, April 2022.&lt;/li>
&lt;li>Reviewer for the Fund for Scientific Research - FNRS, Belgium, May 2023.&lt;/li>
&lt;li>Reviewer for the Research Foundation Flanders, Belgium, January 2022.&lt;/li>
&lt;li>Reviewer for the National Research and Development Agency, Chile, October 2021.&lt;/li>
&lt;li>Program committee member for the 11th International Conference on Operations Research and Enterprise Systems (ICORES), online conference, February 2022.&lt;/li>
&lt;li>Program committee member of the 13th World Congress on Nature &amp;amp; Biologically Inspired Computing (NaBIC), online, December 2021.&lt;/li>
&lt;li>Program committee member of the International Conference on Hybrid Intelligent Systems (HIS), online, December 2021.&lt;/li>
&lt;li>Reviewer for the journal Springer Nature Computer Science, August 2021.&lt;/li>
&lt;li>Reviewer for the journal Neural Computing and Applications, July 2021.&lt;/li>
&lt;li>Program committee member of the 6th International Conference on Machine Learning, Optimization, and Data Science (LOD), Grasmere, Lake District, England, October 2021.&lt;/li>
&lt;li>Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 18th International Conference on Computer Aided Systems Theory (EUROCAST), Gran Canaria, Spain, February 2022.&lt;/li>
&lt;li>Reviewer for the Journal Computers &amp;amp; Operations Research, June 2021.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2021 (EvoCOP 2021), Seville, Spain, April 2021.&lt;/li>
&lt;li>Reviewer for the journal Int. Transactions in Operational Research (ITOR), December 2020.&lt;/li>
&lt;li>Reviewer for the European Journal of Operational Research (EJOR), November 2020.&lt;/li>
&lt;li>Program committee member for the 10th International Conference on Operations Research and Enterprise Systems (ICORES), online conference, February 2021.&lt;/li>
&lt;li>Program Committee Member for the 8th International Conference on Variable Neighborhood Search (ICVNS2020), Abu Dhabi, U.A.E., October 2020.&lt;/li>
&lt;li>Program committee member of the 1st International Workshop on Heuristic Search (HSI20) in conjunction with the Joint Conference on Artificial Intelligence (IJCAI), Yokohama, Japan, July 2020.&lt;/li>
&lt;li>Program committee member of the International Joint Conference on Artificial Intelligence (IJCAI), Yokohama, Japan, July 2020.&lt;/li>
&lt;li>Program committee member of the Evolutionary Combinatorial Optimization and Metaheuristics Track at the 2020 Genetic and Evolutionary Computation Conference (GECCO), Cancun, Mexico, July 2020.&lt;/li>
&lt;li>Program committee member of the 6th International Conference on Machine Learning, Optimization, and Data Science (LOD), Siena, Italy, July 2020.&lt;/li>
&lt;li>Program committee member of the 16th International Conference on Parallel Problem Solving from Nature (PPSN 2020), Leiden, The Netherlands, September 2020.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2020 (EvoCOP 2020), Seville, Spain, April 2020.&lt;/li>
&lt;li>Program committee member of the International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR), Vienna, Austria, May 2020.&lt;/li>
&lt;li>Program committee member for the 9th International Conference on Operations Research and Enterprise Systems (ICORES), Valetta, Malta, Portugal, February 2020.&lt;/li>
&lt;li>Program committee member of the 12th International Conference on Swarm Intelligence (ANTS), Barcelona, Spain, October 2020.&lt;/li>
&lt;li>Reviewer for the journal Evolutionary Computation, August 2019.&lt;/li>
&lt;li>Reviewer for the journal Constraints, July 2019.&lt;/li>
&lt;li>Associate Editor for ACM Transactions on Evolutionary Learning and Optimization, since June 2019.&lt;/li>
&lt;li>Program Committee Member of the 11th International Conference on Evolutionary Computation Theory and Applications (ECTA), Vienna, Austria, September 2019.&lt;/li>
&lt;li>Program committee member of the 5th International Conference on Machine Learning, Optimization, and Data Science (LOD), Siena, Italy, September 2019.&lt;/li>
&lt;li>Co-Chair of the Metaheuristics Stream at Operations Research 2019 (OR 2019), Dresden, Germany, September 2019.&lt;/li>
&lt;li>Program Committee Member for the 7th International Conference on Variable Neighborhood Search (ICVNS2019), Rabat, Morocco, October 2019.&lt;/li>
&lt;li>Program committee member of the Evolutionary Combinatorial Optimization and Metaheuristics Track at the 2019 Genetic and Evolutionary Computation Conference (GECCO), Prague, Czech Republic, July 2019.&lt;/li>
&lt;li>Program committee member of the Metaheuristics International Conference (MIC 2019), Cartagena, Colombia, July 2019.&lt;/li>
&lt;li>Reviewer for the Swiss National Science Foundation, December 2018.&lt;/li>
&lt;li>Reviewer for the 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Berlin, Germany, March 2019.&lt;/li>
&lt;li>Reviewer for the journal OMEGA, September 2018.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2019 (EvoCOP 2019), Leipzig, Germany, April 2019.&lt;/li>
&lt;li>Speaker at the Metaheuristcs Summer School 2018 (MESS), Acireale, Sicily, July 2018.&lt;/li>
&lt;li>Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 17th International Conference on Computer Aided Systems Theory (EUROCAST), Gran Canaria, Spain, February 2018.&lt;/li>
&lt;li>Program committee member of the 11th Workshop on Hybrid Metaheuristics (HM 2019), Conception, Chile, January 2019.&lt;/li>
&lt;li>Steering committee member of EvoAPPS, the Int. Conference Series on Applications of Evolutionary Computation, since March 2018.&lt;/li>
&lt;li>Reviewer for the Research Foundation Flanders, Belgium, March 2018.&lt;/li>
&lt;li>Reviewer for the Central European Journal of Operations Research (CJOR), March 2018.&lt;/li>
&lt;li>PhD examiner for the Unviersity of Antwerp, Belgium, May 2018.&lt;/li>
&lt;li>Program committee member of the 4th International Conference on Machine Learning, Optimization, and Data Science (LOD), Volterra, Italy, September 2018.&lt;/li>
&lt;li>Program committee member of the 2018 IEEE Congress on Evolutionary Computation (CEC 2018), Rio de Janeiro, Brazil, July 2018.&lt;/li>
&lt;li>Program committee member of the 11th International Conference on Swarm Intelligence (ANTS), Rome, Italy, October 2018.&lt;/li>
&lt;li>Program committee member of the 12th International Conference on Practice and Theory of Automated Time Tabling (PATAT 2018), Vienna, Austria, August 2018.&lt;/li>
&lt;li>Program committee member of the 15th International Conference on Parallel Problem Solving from Nature (PPSN 2018), Coimbra, Portugal, September 2018.&lt;/li>
&lt;li>Editorial board member of the Metaheuristics journal, Springer, since January 2018.&lt;/li>
&lt;li>Program committee member of the Evolutionary Combinatorial Optimization and Metaheuristics Track at the 2018 Genetic and Evolutionary Computation Conference (GECCO), Kyoto, July 2018.&lt;/li>
&lt;li>Program committee member of Matheuristics 2018, the International Workshop on Model Based Metaheuristics, Tours, France, June 2018.&lt;/li>
&lt;li>Research proposal evaluator for the Cyprus Research Promotion Foundation (RPF), September 2017.&lt;/li>
&lt;li>Program Committee Member for the 6th International Conference on Variable Neighborhood Search (ICVNS2018), Sithonia, Greece, October 2018.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2018 (EvoCOP 2018), Parma, Italy, April 2017.&lt;/li>
&lt;li>Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Madeira, Portugal, January 2018.&lt;/li>
&lt;li>Local Organization Committee member of the ALGO 2017 congress, Vienna, September 2017.&lt;/li>
&lt;li>Reviewer for the 8th Int. Conference on Computational Logistics (ICCL 2017), Southampton, UK, October 2017.&lt;/li>
&lt;li>Reviewer for the EURO Working Group on Transportation Meeting, Budapest, September 2017.&lt;/li>
&lt;li>Reviewer for the Journal of Discrete Algorithms, April 2017.&lt;/li>
&lt;li>Reviewer for the Research Foundation Flanders, Belgium, April 2017.&lt;/li>
&lt;li>Reviewer for the Journal of Combinatorial Optimization, April 2017.&lt;/li>
&lt;li>PhD examiner for the University of Adelaide, Australia, March 2017.&lt;/li>
&lt;li>Reviewer for Int. Conf. on Optimization and Decision Science (ODS 2017), XLVII Meeting of AIRO, Sorrento, Italy, September 2017.&lt;/li>
&lt;li>Program committee member of the Metaheuristics International Conference (MIC 2017), Barcelona, Spain, July 2017.&lt;/li>
&lt;li>Reviewer for the Journal Computers &amp;amp; Operations Research, January 2017.&lt;/li>
&lt;li>Program committee member of the 2017 IEEE Congress on Evolutionary Computation (CEC 2017), San Sebastian, Basque Country, June 2017.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2017 (EvoCOP 2017), Amsterdam, The Netherlands, April 2017.&lt;/li>
&lt;li>Reviewer for the Journal International Transactions in Operational Research, November 2016.&lt;/li>
&lt;li>Program committee member of the Generally Evolutionary Computation and Hybrids Track at the 2017 Genetic and Evolutionary Computation Conference (GECCO), Berlin, Germany, July 2016.&lt;/li>
&lt;li>Reviewer for the 11th Conference and Workshops on Algorithms and Computation (WALCOM), Hsinchu, Japan, March 2017.&lt;/li>
&lt;li>Referee for the Austrian Exchange Service (Österreichischen Austauschdienst), September 2016.&lt;/li>
&lt;li>Reviewer for the Central European Journal of Operations Research, September 2016.&lt;/li>
&lt;li>Reviewer for the Journal of Heuristics, August 2016.&lt;/li>
&lt;li>Reviewer for the European Journal of Operational Research, August 2016.&lt;/li>
&lt;li>Reviewer for the Journal Computers &amp;amp; Operations Research, August 2016.&lt;/li>
&lt;li>Reviewer for the Journal Parallel and Distributed Systems, June 2016.&lt;/li>
&lt;li>Program Committee Member for the 4nd International Conference on Variable Neighborhood Search (VNS2016), Malaga, Spain, October 2016.&lt;/li>
&lt;li>Reviewer for the Journal of Heuristics, May 2016.&lt;/li>
&lt;li>Reviewer for the Journal Transportation Research Part B, May 2016.&lt;/li>
&lt;li>Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Porto, Portugal, February 2017.&lt;/li>
&lt;li>Program committee member of the 5th International Conference on Computational Logistics (ICCL), Lisbon, Portugal, September 2016.&lt;/li>
&lt;li>Reviewer for the Research Foundation Flanders, Belgium, March 2016.&lt;/li>
&lt;li>Reviewer for 4th International Symposium on Combinatorial Optimization (ISCO), Salerno, Italy, May 2016.&lt;/li>
&lt;li>Program committee member of the 2016 IEEE Congress on Evolutionary Computation (CEC), Vancouver, Canada., July 2016.&lt;/li>
&lt;li>Program committee member of the 10th International Conference on Swarm Intelligence (ANTS), Brussels, Belgium, September 2016&lt;/li>
&lt;li>Program committee member of the 6th International Workshop on Model Based Metaheuristics (Matheuristics), Brussels, Belgium, September 2016&lt;/li>
&lt;li>Management Board Member of the EU COST Action CA15140 Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice (ImAppNIO), since January 2016&lt;/li>
&lt;li>Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 16th International Conference on Computer Aided Systems Theory (EUROCAST), Gran Canaria, Spain, February 2017.&lt;/li>
&lt;li>Reviewer for the Japan Society for the Promotion of Science (JSPS), January 2016&lt;/li>
&lt;li>Program committee member of the 6th International Conference on Metaheuristics and Nature Inspired Computing (META'2016), Marrakech, Morocco, October 2016&lt;/li>
&lt;li>Program committee member of the Second International Workshop on Machine learning, Optimization and big Data (MOD 2016), Volterra, Italy, August 2016&lt;/li>
&lt;li>Program committee member of the Evolutionary and Combinatorial Optimization and Metaheuristic Track at the 2016 Genetic and Evolutionary Computation Conference (GECCO), Denver, Colorado, July 2016.&lt;/li>
&lt;li>PhD referee for the Tel Aviv University, Israel, December 2015&lt;/li>
&lt;li>Reviewer for the 2016 European Control Conference (ECC 2016), Aalborg, Denmark, December 2016&lt;/li>
&lt;li>Reviewer for The Netherlands Organisation for Scientific Research (NWO, the Dutch Research Council), September 2015.&lt;/li>
&lt;li>Steering committee and program committee member of the 10th Workshop on Hybrid Metaheuristics (HM 2016), Plymouth, UK, June 2016.&lt;/li>
&lt;li>Reviewer for a staff promotion at the University of Adelaide, Australia, August 2015.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2015 (EvoCOP 2016), Porto, Portugal, March 2016.&lt;/li>
&lt;li>PhD examiner for the University of Adelaide, Australia, April 2015.&lt;/li>
&lt;li>Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Rome, Italy, February 2016.&lt;/li>
&lt;li>Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Dubai, January 2015.&lt;/li>
&lt;li>Program committee member of the Evolutionary and Combinatorial Optimization and Metaheuristic Track at the 2015 Genetic and Evolutionary Computation Conference (GECCO), Madrid, Spain, July 2015.&lt;/li>
&lt;li>Program committee member of the 6th International Conference on Computational Logistics (ICCL), Delft, The Netherlands, September 2015.&lt;/li>
&lt;li>Reviewer for the International Journal of Soft Computing and Networking (IJSCN), October 2014.&lt;/li>
&lt;li>Reviewer for the journal Computers &amp;amp; Operations Research (COR), August 2014.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2015 (EvoCOP 2015), Copenhagen, Denmark, April 2015.&lt;/li>
&lt;li>Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 15th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, February 2015.&lt;/li>
&lt;li>Reviewer for the Slovenian Research Agency, August 2014.&lt;/li>
&lt;li>Reviewer for the Danish Council for Independent Research (DFF-YDUN), July 2014.&lt;/li>
&lt;li>Reviewer for the Journal Optimization Methods and Software, June 2014.&lt;/li>
&lt;li>Program committee member of the 3rd Int. IFToMM Conference on Graph Modelling in Engineering (GME), Bielsko-Biala, Poland, September 2015.&lt;/li>
&lt;li>Program committee member of the 5th International Conference on Computational Logistics (ICCL), Valparaíso, Chile, September 2014.&lt;/li>
&lt;li>Program committee member of the Learning and Intelligent Optimization (LION9), Lille, France 2015.&lt;/li>
&lt;li>Member of the advisory board of the Memetic Computing Lab (McLab) at the School of Computer Science, China University of Geosciences, since March 2014.&lt;/li>
&lt;li>Reviewer for the Journal Transportation Science, April 2014.&lt;/li>
&lt;li>Reviewer for the European Journal on Operational Research (EJOR), October 2014.&lt;/li>
&lt;li>Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Dubai, UAE, January 2015.&lt;/li>
&lt;li>Steering committee and program committee member of the 9th Workshop on Hybrid Metaheuristics (HM 2014), Hamburg, Germany, June 2014.&lt;/li>
&lt;li>Reviewer for the 22nd European Conference for Information Systems (ECIS), Tel Aviv, June 2014.&lt;/li>
&lt;li>Program Committee Member for the 3nd International Conference on Variable Neighborhood Search Metaheuristic, Djerba, Tunisia, October 2014.&lt;/li>
&lt;li>Program committee member of the 4th International Conference on Metaheuristics and Nature Inspired Computing (META 14), Marakkech, Morocco, October 2014.&lt;/li>
&lt;li>Program committee member of the 5th International Conference on Computational Logistics, September 2014.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2014 (EvoCOP 2014), Baeza, Spain, April 2014.&lt;/li>
&lt;li>Program committee member of the Learning and Intelligent Optimization (LION8), Gainsville, Florida 2014.&lt;/li>
&lt;li>Co-editor of the special issue on Metaheuristics of the Journal of Heuristics, August 2013.&lt;/li>
&lt;li>Reviewer for the Journal of Heuristics, August 2013.&lt;/li>
&lt;li>Co-Chair of the Evolutionary Combinatorial Optimization and Metaheuristics Track at the 2014 Genetic and Evolutionary Computation Conference (GECCO), Vancouver, Canada July 2014.&lt;/li>
&lt;li>Reviewer for the journal BISE / Wirtschaftsinformatik, August 2013.&lt;/li>
&lt;li>Reviewer for Computers &amp;amp; Operations Research, July 2013.&lt;/li>
&lt;li>Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Angers, France, March 2014.&lt;/li>
&lt;li>Reviewer for Networks, June 2013.&lt;/li>
&lt;li>Executive Board member of ÖGOR, the Austrian Society of Operations Research, since January 2013.&lt;/li>
&lt;li>Reviewer for the IMA Journal of Management Mathematics, March 2013.&lt;/li>
&lt;li>Reviewer for the University of Antwerp for academic staff promotion, March 2013.&lt;/li>
&lt;li>Reviewer for Transportation Science, March 2013.&lt;/li>
&lt;li>Reviewer for the European Journal on Operational Research (EJOR), February 2013.&lt;/li>
&lt;li>Reviewer for Networks, February 2013.&lt;/li>
&lt;li>Program committee member of the 8th Workshop on Hybrid Metaheuristics (HM 2010), Ischia, Italy, May 2013.&lt;/li>
&lt;li>Program committee member of The 1st IEEE International Workshop on Architecture, Design, Deployment and Management of Networks &amp;amp; Applications (ADMNET) at the 37th Annual International Computer Software &amp;amp; Applications Conference, Kyoto, Japan, July 2013.&lt;/li>
&lt;li>Local Co-Organizer of EvoStar 2013, The Leading European Event on Bioinspired Computation, Vienna, Austria, April 2013.&lt;/li>
&lt;li>Program Chair of the 10th Metaheuristic International Conference (MIC) 2013, Singapore, August 2013.&lt;/li>
&lt;li>Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 14th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, February 2013.&lt;/li>
&lt;li>Reviewer for the Journal of Global Optimization, January 2013.&lt;/li>
&lt;li>Reviewer for the International Network Optimization Conference (INOC) 2013, Tenerife, Spain, May 2013.&lt;/li>
&lt;li>Program committee member of the Evolutionary &amp;amp; Metaheuristic Combinatorial Optimization Track at the 2012 Genetic and Evolutionary Computation Conference (GECCO), Amsterdam, The Netherlands, July 2013.&lt;/li>
&lt;li>Program committee member of LION 7, the 7th Learning and Intelligent Optimization Conference, Catania, Italy, January 2013.&lt;/li>
&lt;li>Reviewer for the Journal Soft Computing, September 2012&lt;/li>
&lt;li>Reviewer for the Journal Flexible Services and Manufacturing, June 2012&lt;/li>
&lt;li>Reviewer for the French Research National Agency (SPAHI), June 2012&lt;/li>
&lt;li>Reviewer for the Journal of Combinatorial Optimization, June 2012&lt;/li>
&lt;li>Program committee member of Matheuristics 2012, the Fourth International Workshop on Model Based Metaheuristics, Angra dos Reis, Rio de Janeiro, Brazil, September 2012&lt;/li>
&lt;li>EvoStar Award for Outstanding Contribution to Evolutionary Computation in Europe, April 2012&lt;/li>
&lt;li>Reviewer for the French Research National Agency (SPAHI), March 2012&lt;/li>
&lt;li>External PhD reviewer for the Universitat Politecnica de Catalunya (UPC), Barcelona, Spain, February 2012&lt;/li>
&lt;li>Program committee member of the 9th Int. Conf. on Simulated Evolution And Learning (SEAL 2012), Hanoi, Vientam, December 2012&lt;/li>
&lt;li>Reviewer for a PhD thesis at the Universitat Politecnica de Catalunya (UPC), Barcelona, Spain, February 2012.&lt;/li>
&lt;li>IEEE Computational Intelligence Society Emergent Technology Technical Committee Member (IEEE CIS ETTC), 2012.&lt;/li>
&lt;li>Program committee member of the Evolutionary &amp;amp; Metaheuristic Combinatorial Optimization Track at the 2012 Genetic and Evolutionary Computation Conference (GECCO), Philadelphia, July 2012.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2012, Malaga, Spain, April 2012.&lt;/li>
&lt;li>Reviewer for the Journal RAIRO - Operations Research, October 2011.&lt;/li>
&lt;li>Program committee member of the 12th International Conference on Parallel Problem Solving from Nature (PPSN 2012), Taormina, Italy, September 2012.&lt;/li>
&lt;li>Reviewer for the Journal Mathematical Methods of Operations Research, October 2011.&lt;/li>
&lt;li>Program committee member of LION 6, the 6th Learning and Intelligent Optimization Conference, Paris, January 2012.&lt;/li>
&lt;li>Program committee member of ANTS 2012, the 8th International Conference on Swarm Intelligence, Brussels, Belgium, September 2012.&lt;/li>
&lt;li>Program Committee Member for the 2nd International Conference on Variable Neighborhood Search Metaheuristic, Montenegro, October 2012.&lt;/li>
&lt;li>Reviewer for Deutsche Forschungsgemeinschaft (DFG, German Research Foundation), September 2011.&lt;/li>
&lt;li>Reviewer for the Austrian Exchange Service (Österreichischen Austauschdienst), September 2011.&lt;/li>
&lt;li>Committee member of the ÖGOR Bank Austria Unicredit Dissertationspreis (PhD dissertation award of the Austrian Operations Research Society), August 2011.&lt;/li>
&lt;li>Reviewer for the IEEE Transactions on Evolutionary Computation, July 2011.&lt;/li>
&lt;li>Reviewer for the Journal Natural Computing, June 2011.&lt;/li>
&lt;li>Reviewer for the Journal Discrete Applied Mathematics, February 2011.&lt;/li>
&lt;li>Program committee member of the 11th IEEE/IPSJ International Symposium on Applications and the Internet, Munich, Germany, July 2011.&lt;/li>
&lt;li>Reviewer for the 10th International Symposium on Experimental Algorithms, Chania, Greece, May 2011.&lt;/li>
&lt;li>Co-Chair of the 2nd Workshop on Heuristic Methods for the Design, Deployment, and Reliability of Networks and Network Applications (HEUNET 2011) in conjunction with the 11th IEEE/IPSJ Symposium on Applications &amp;amp; the Internet (SAINT 2011), Munich, Germany, July 2011.&lt;/li>
&lt;li>Reviewer for the Journal Mathematical Programming Computation, January 2011.&lt;/li>
&lt;li>Reviewer for the journal Mathematical Problems in Engineering, November 2010.&lt;/li>
&lt;li>Reviewer for the Central European Journal of Operations Research, October 2010.&lt;/li>
&lt;li>Advisory board member of the 25th (Jubilee) European Conference on Modelling and Simulation (ECMS) 2011, Cracow, Poland, June 2011.&lt;/li>
&lt;li>Program committee member of the 9th Metaheuristics International Conference (MIC) 2011, Udine, Italy, July 2011.&lt;/li>
&lt;li>Reviewer for the IEEE Transactions on Evolutionary Computation, August 2010.&lt;/li>
&lt;li>Guest-Editor of the Special Issue on Intelligent Computational Tools for Routing in Distribution Planning of the Journal Advances in Decision Science, 2010.&lt;/li>
&lt;li>Co-Chair of the Third International Workshop on Information Network Design at the International Conference on Intelligent Networking and Collaborative Systems (INCoS 2010), Thessaloniki, Greece, November 2010.&lt;/li>
&lt;li>Co-Chair of the Evolutionary &amp;amp; Metaheuristic Combinatorial Optimization Track at the 2011 Genetic and Evolutionary Computation Conference (GECCO), Dublin, Ireland, July 2011.&lt;/li>
&lt;li>Co-Chair of the Workshop on Heuristic Problem Solving at the 13th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, February 2011.&lt;/li>
&lt;li>Reviewer for the Central European Journal of Operations Research, July 2010.&lt;/li>
&lt;li>Program committee member of the Learning and Intelligent Optimization (LION5), Rome, Italy, January 2011.&lt;/li>
&lt;li>Reviewer for a PhD thesis at the Brno University of Technology, Brno, Czech Republic, March 2010&lt;/li>
&lt;li>Program committee member of the International Network Optimization Conference (INOC) 2011, Hamburg, Germany, 2011&lt;/li>
&lt;li>Reviewer for the Journal of Heuristics, April 2010.&lt;/li>
&lt;li>Reviewer for the journal Mathematical Methods of Operations Research, March 2010.&lt;/li>
&lt;li>Reviewer for the journal OR Spectrum, February 2010.&lt;/li>
&lt;li>Reviewer for the journal Information Sciences, February 2010.&lt;/li>
&lt;li>Reviewer for the Journal Annals of Mathematics and Artificial Intelligence, November 2009.&lt;/li>
&lt;li>Reviewer for the Journal Applied Computational Intelligence and Soft Computing, October 2009.&lt;/li>
&lt;li>Reviewer for the Journal Computers and Operations Research, October 2009.&lt;/li>
&lt;li>Program committee member of the 11th International Conference on Parallel Problem Solving From Nature (PPSN), Krakow, Poland, September 2010.&lt;/li>
&lt;li>Program committee member of the Combinatorial Optimization and Metaheuristics Track at the Genetic and Evolutionary Computation Conference (GECCO) 2010, Portland, Oregon, July 2010.&lt;/li>
&lt;li>Program committee member of the International Conference on Metaheuristics and Nature Inspired Computing (META10), Djerba Island, Tunisia, October 2010.&lt;/li>
&lt;li>Program committee member of the International Conference on Intelligent Networking and Collaborative Systems (WIND09), Barcelona, Spain, November 2009.&lt;/li>
&lt;li>Program committee member of the Learning and Intelligent Optimization (LION4), Venice, Italy, January 2010.&lt;/li>
&lt;li>Reviewer for Optimization Methods and Software, February 2008.&lt;/li>
&lt;li>Editor-in-Chief and Program Chair of GECCO 2009, the 11th Annual Conference on Genetic and Evolutionary Computation, ACM, Montreal, Canada, July 2009.&lt;/li>
&lt;li>Co-Chair of the Workshop on Heuristic Problem Solving at the 12th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, February 2009.&lt;/li>
&lt;li>Co-Chair of the Workshop on Heuristic Methods for the Design, Deployment, and Reliability of Networks and Network Applications (HEUNET 2008) at the 2008 International Symposium on Applications and the Internet, Turku, Finland, July 2008.&lt;/li>
&lt;li>Program committee member of the 6th Int. Workshop on Hybrid Metaheuristics, Udine, Italy, October 2009.&lt;/li>
&lt;li>Reviewer for the European Journal on Operational Research (EJOR), January 2008.&lt;/li>
&lt;li>Program committee member of the workshop SLS 2009, Engineering Stochastic Local Search Algorithms - Designing, Implementing and Analyzing Effective Heuristics, Brussels, Belgium, September 2009.&lt;/li>
&lt;li>Member of the editorial board of the Internatianal Journal of Artificial Evolution and Applications, Hindawi Publishing, invited November 2008.&lt;/li>
&lt;li>Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Hawaii, March 2009.&lt;/li>
&lt;li>Program committee member of the World Congress on Nature &amp;amp; Biologically Inspired Computing (NaBIC), Orissa, India, February 2009&lt;/li>
&lt;li>Reviewer for the journal Theoretical Computer Science, Elsevier, August 2008.&lt;/li>
&lt;li>Reviewer for the journal Algorithmica, June 2008.&lt;/li>
&lt;li>Program Committee member of the International Conference on Metaheuristics and Nature Inspired Computing, Tunisia, October 2008&lt;/li>
&lt;li>Program committee member of the Learning and Intelligent Optimization (LION3), Trento, January 2009.&lt;/li>
&lt;li>Program committee member of the Workshop on Hybrid Metaheuristics, Malaga, Spain, October 2008.&lt;/li>
&lt;li>Reviewer for the IEEE Transactions on Evolutionary Computation, January 2008.&lt;/li>
&lt;li>Reviewer for the Journal Annals of Operations Research, January 2008.&lt;/li>
&lt;li>Program committee member of the International Conference on Parallel Problem Solving from Nature (PPSN), Dortmund, Germany, September 2008.&lt;/li>
&lt;li>Program committee member of the World Congress on Computational Intelligence, Hong Kong, June 2008.&lt;/li>
&lt;li>Reviewer for the Journal Swarm Intelligence, November 2007.&lt;/li>
&lt;li>Reviewer for the Journal Information Systems and Operational Research (INFOR), November 2007.&lt;/li>
&lt;li>Program committee member of the European Workshop on Intelligent Computational Methods and Applied Mathematics (ICMAM2008), Cracow, March 2008.&lt;/li>
&lt;li>Reviewer for the journal Algorithmica, November 2007.&lt;/li>
&lt;li>Program committee member of the International Conference on Hybrid Intelligent Systems (HIS'08), Barcelona, Spain, September 2008.&lt;/li>
&lt;li>Reviewer for the Computers &amp;amp; Operations Researc Journal, November 2007.&lt;/li>
&lt;li>Reviewer for the INFORMS Journal on Computing, October 2007.&lt;/li>
&lt;li>Program committee member of EvoPhD 2008, the second European Graduate Workshop on Evolutionary Computation, Napels, Italy, April 2008.&lt;/li>
&lt;li>Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2008 (EvoCOP 2008), Naples, Italy, April 2008.&lt;/li>
&lt;li>Reviewer for the Journal Engineering Optimization, September 2007.&lt;/li>
&lt;li>Reviewer for the Journal of Artificial Evolution and Applications, September 2007.&lt;/li>
&lt;li>Associate editor of the International Journal of Metaheuristics, Inderscience, since October 2007.&lt;/li>
&lt;li>Editorial board member of the journal Memetic Computing, Springer, since October 2007.&lt;/li>
&lt;li>Reviewer for the Applied Artificial Intelligence (AAI) Journal, September 2007.&lt;/li>
&lt;li>Program committee member of the 23. ACM Symposium on Applied Computing, Forteleza, Brazil, March 2008.&lt;/li>
&lt;li>Program committee member of Matheuristics 2008, the Second International Workshop on Model Based Metaheuristics, Bertinoro, Italy, June 2008.&lt;/li>
&lt;li>Reviewer for the IEEE Transactions on Evolutionary Computation, July 2007.&lt;/li>
&lt;li>Program committee member of the Genetic and Evolutionary Computation Conference 2008, July 2008.&lt;/li>
&lt;li>Reviewer for the European Journal of Operational Research, May 2007.&lt;/li>
&lt;li>Program committee member of the 4th Workshop on Hybrid Metaheuristics (HM 2007), Dortmund, Germany, October 2007.&lt;/li>
&lt;li>Reviewer for the Evolutionary Computation Journal, April 2007.&lt;/li>
&lt;li>Program committee member for the special session Analysis of Genetic Representations and Operators (AGRO 2007) at the IEEE Conference on Evolutionary Computation, Singapore, September 2007.&lt;/li>
&lt;li>Program committee member of MIC 2007, the 7th Metaheuristics International Conference, Montreal, Canada, June 2007.&lt;/li>
&lt;li>Reviewer for the Journal of Heuristics, February 2007.&lt;/li>
&lt;li>Program committee member of the 2nd Int. Workshop on Hybrid Artificial Intelligence Systems (HAIS 2007), November 2007.&lt;/li>
&lt;li>Program committee member of the Evolution Artificielle conference, Tours, France, October 2007.&lt;/li>
&lt;li>Reviewer for the Evolutionary Computation Journal, January 2007.&lt;/li>
&lt;li>Member of the editorial board of the Journal of Artificial Evolution and Applications, Hindawi Publishing, since January 2007.&lt;/li>
&lt;li>Reviewer for the IEEE Transactions on Evolutionary Computation, IEEE Press, January 2007.&lt;/li>
&lt;li>Reviewer for the ACM Journal of Experimental Algorithms, December 2006.&lt;/li>
&lt;li>Reviewer for the Slovak Research and Development Agency, December 2006.&lt;/li>
&lt;li>Reviewer for the INFORMS Journal on Computing, October 2006.&lt;/li>
&lt;li>Reviewer for the European Journal on Operational Research (EJOR), October 2006.&lt;/li>
&lt;li>Reviewer for Networks (journal), special issue on trees, September 2006.&lt;/li>
&lt;li>Program committee member of the Formal Theory Track at the Genetic and Evolutionary Computation Conference (GECCO) 2007, London, U.K., July 2007.&lt;/li>
&lt;li>Program committee member of the workshop SLS 2007, Engineering Stochastic Local Search Algorithms - Designing, Implementing and Analyzing Effective Heuristics, Brussels, Belgium, September 2007.&lt;/li>
&lt;li>Program committee member of the 1st IEEE Symposium on Foundations of Computational Intelligence (FOCI'07), Honolulu, Hawaii, April 2007.&lt;/li>
&lt;li>Referee for the Austrian Exchange Service (Österreichischen Austauschdienst), since September 2006.&lt;/li>
&lt;li>Program committee member of the 2006 International Conference on Hybrid Intelligent Systems (HIS), Auckland, New Zealand, December 2006.&lt;/li>
&lt;li>Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Seoul, Korea, March 2007.&lt;/li>
&lt;li>Program committee member of EvoPhD 2007, the second European Graduate Workshop on Evolutionary Computation, Valencia, Spain, April 2007.&lt;/li>
&lt;li>Member of the scientific committee of IWINAC-2007, the 2nd Int. Work-Conference on the Interplay between Natural and Artificial Computation, 2007.&lt;/li>
&lt;li>Reviewer for the Special Issue on Variable Neighborhood Search of the European Journal of Operational Research, 2006.&lt;/li>
&lt;li>Reviewer for the post-conference publications of the Applications of Operational Research for Development (ORPA) 2005 Conference, 2006.&lt;/li>
&lt;li>Founder and steering committee member of EvoCOP, the series of European Conferences on Evolutionary Computation in Combinatorial Optimization, since 2001.&lt;/li>
&lt;li>Reviewer for the journal Theoretical Computer Science, Elsevier, since April 2006.&lt;/li>
&lt;li>Advisory board member of the ECAI Workshop on Evolutionary Computation, Riva del Garda, August 2006.&lt;/li>
&lt;li>Review panel member of the Academy of Finland, Research Council for Natural Sciences and Engineering, in the fields of computer science, since March 2006.&lt;/li>
&lt;li>Reviewer for the the special issue &amp;ldquo;Bio-inspired Metaheuristics for Compbinatorial Optimization Problems&amp;rdquo; of the journal Computers and Operations Research, January 2006.&lt;/li>
&lt;li>Reviewer for The Netherlands Organisation for Scientific Research (NWO, the Dutch Research Council), since February 2006.&lt;/li>
&lt;li>Reviewer for the journal Computers &amp;amp; Industrial Engineering, Elsevier, since February 2006.&lt;/li>
&lt;li>Reviewer for the First Conference on Operational Research Practice in Africa, ORPA 2005, post conference proceedings, 2005.&lt;/li>
&lt;li>Program committee member of the 3rd Int. Workshop on Hybrid Metaheuristics, Gran Canaria, Spain, October 2006.&lt;/li>
&lt;li>Reviewer for the Int. Journal of Computational Intelligence Research, since December 2005.&lt;/li>
&lt;li>Reviewer for the journal Natural Computing, since October 2005.&lt;/li>
&lt;li>Chair of the Evolutionary Computation in Combinatorial Optimization Conference 2006 (EvoCOP 2006), Budapest, Hungary, April 2004.&lt;/li>
&lt;li>Program committee member of EvoPhD 2006, the first European Graduate Workshop on Evolutionary Computation, Budapest, Hungary, April 2006.&lt;/li>
&lt;li>Program committee member of EvoComNet 2006, the third Workshop on Evolutionary Computation in Communications, Networks, and Connected Systems, Budapest, Hungary, April 2006.&lt;/li>
&lt;li>Program committee member of the Ninth International Conference on Parallel Problem Solving from Nature, Reykjavic, Iceland, September 2006.&lt;/li>
&lt;li>Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Dijon, France, April 2006.&lt;/li>
&lt;li>Program committee member of the 2005 International Conference on Hybrid Intelligent Systems (HIS), Rio de Janeiro, Brazil, November 2005.&lt;/li>
&lt;li>Reviewer for the Journal Discrete Optimization, since April 2003.&lt;/li>
&lt;li>Program committee member of the International Conference on Machine Intelligence (ACIDCA-ICMI) 2005, Tozeur, Tunisia, November 2005.&lt;/li>
&lt;li>Reviewer for the Journal of Operational Research Society (JORS), since March 2005.&lt;/li>
&lt;li>Reviewer for the Journal of Mathematical Modelling and Algorithms, since March 2005.&lt;/li>
&lt;li>Referee for the 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Orlando, FL, July 2005.&lt;/li>
&lt;li>Program committee member of the 10th Online World Conference on Soft Computing in Industrial Applications, Cranfield University, U.K., September 2005.&lt;/li>
&lt;li>Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Santa Fe, New Mexico, March 2005.&lt;/li>
&lt;li>Reviewer for the ACM-SIAM Symposium on Discrete Algorithms 2005, Bancouver, British Columbia, January 2005.&lt;/li>
&lt;li>Associate editor of the Evolutionary Computation Journal, MIT Press, since January 2006.&lt;/li>
&lt;li>Program committee member of the 4th EU/ME Workshop on Design and Evaluation of Advanced Hybrid Metaheuristics, Nottingham. U.K., November 2004.&lt;/li>
&lt;li>Program committee member of the 7th International Conference on Artificial Evolution, Lille, France, October 2005.&lt;/li>
&lt;li>Program committee member of EvoComNet 2005, the second Workshop on Evolutionary Computation in Communications, Networks, and Connected Systems, Lausanne, Switzerland, April 2006.&lt;/li>
&lt;li>Chair of the Evolutionary Combinatorial Optimization Track at the 2005 Genetic and Evolutionary Computation Conference (GECCO), Washington D.C., June 2005.&lt;/li>
&lt;li>Technical co-chair of the 2005 IEEE Congress on Evolutionary Computation (CEC), Edinburgh, U.K., September 2005.&lt;/li>
&lt;li>Chair of the Evolutionary Computation in Combinatorial Optimization 2005 Conference (EvoCOP 2005), Lausanne, Switzerland, April 2004.&lt;/li>
&lt;li>Program committee member of the 2004 International Conference on Hybrid Intelligent Systems (HIS), Kitakyushu, Japan, December 2004.&lt;/li>
&lt;li>Reviewer for the journal Machine Graphics &amp;amp; Vision, March 2004.&lt;/li>
&lt;li>Program committee member of MIC 2005, the 6th Metaheuristics International Conference, Vienna, ia, August 2005.&lt;/li>
&lt;li>Reviewer for the special issue of Computers and Operations Research on Logistics of Health Care Management, December 2003.&lt;/li>
&lt;li>Reviewer for the INFORMS Journal on Computing, since December 2003&lt;/li>
&lt;li>Program committee member of the Eigth International Conference on Parallel Problem Solving from Nature, Birmingham, U.K., September 2004.&lt;/li>
&lt;li>Program committee member of the IEEE Congress on Evolutionary Computation 2004, Portland, Oregon, June 2004.&lt;/li>
&lt;li>Reviewer for the European Journal of Operational Research, since August 2004.&lt;/li>
&lt;li>Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Nicosia, Cyprus, March 2004.&lt;/li>
&lt;li>Program committee member of EvoComNet 2004, the first Workshop on Evolutionary Computation in Communications, Networks, and Connected Systems, Coimbra, Portugal, April 2004.&lt;/li>
&lt;li>Chair of the Evolutionary Computation in Combinatorial Optimization 2004 (EvoCOP 2004), Coimbra, Portugal, April 2004.&lt;/li>
&lt;li>Chair of EvoWorkshops 2004, Coimbra, Portugal, April 2004.&lt;/li>
&lt;li>Chair of the Fourth European Conference on Evolutionary Computation in Combinatorial Optimization 2004 (EvoCOP 2004), Coimbra, Portugal, April 2004.&lt;/li>
&lt;li>Program committee member of the IEEE Congress on Evolutionary Computation 2003, Canberra, Australia, December 2003.&lt;/li>
&lt;li>Reviewer for the Journal of Systemics, Cybernetics and Informatics, since Mai 2003.&lt;/li>
&lt;li>Program committee member of the 30th Int. Colloquium on Automata, Languages, and Programming (ICALP 2003), Workshop on Fundamentals of Evolutionary Algorithms, Eindhoven, The Netherlands, July 2003.&lt;/li>
&lt;li>Referee for the 7th World Multi-Conference on Systemics, Cybernetics and Informatics, Orlando, FL, July 2003.&lt;/li>
&lt;li>Reviewer for the IMA Journal of Applied Mathematics, March 2003.&lt;/li>
&lt;li>Program committee member of the 3rd International Conference on Hybrid Intelligent Systems (HIS 2003), Melbourne, Australia, December 2003.&lt;/li>
&lt;li>Program committee member of the 2003 Workshop on Analysis and Design of Representations and Operators (ADoRO), Chicago, USA, July 2003.&lt;/li>
&lt;li>Member of the organizing committee of the 2003 Workshop on Application of Hybrid Evolutionary Algorithms to NP-Complete Problems (EvoHybridNP), Chicago, USA, July 2003.&lt;/li>
&lt;li>Program committee member of the 4th International Workshop on Memetic Algorithms (WOMA IV), Chicago, USA, July 2003.&lt;/li>
&lt;li>Reviewer for the GRAPHIT2003 International Conference on Computer Graphics and Interactive Techniques in Australasia and South East Asia, Melbourne, Australia, February 2003.&lt;/li>
&lt;li>Chair of EvoWorkshops 2003, proceedings editor, and chair of the Third European Workshop on Evolutionary Computation in Combinatorial Optimization 2003, Essex, U.K., April 2003.&lt;/li>
&lt;li>Reviewer for the jubilee fund of the Austrian national bank (Jubiläumsfond der Österreichischen Nationalbank), 2002.&lt;/li>
&lt;li>Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Melbourne, FL, March 2003.&lt;/li>
&lt;li>Reviewer for the Metaheuristics International Conference (MIC) 2001 book, May 2002.&lt;/li>
&lt;li>Program committee member of the 2nd International Conference on Hybrid Intelligent Systems (HIS'02), Santiago, Chile, December 2002.&lt;/li>
&lt;li>Program committee member of the Mendel 2002 International Conference on Soft Computing, Brno, Czech Republic, June 2002.&lt;/li>
&lt;li>Reviewer for the Science Foundation Ireland, since November 2001.&lt;/li>
&lt;li>Program committee member of the Workshop on Representations for Genetic and Evolutionary Algorithms 2002, New York, July 2002.&lt;/li>
&lt;li>Program committee member of the Genetic and Evolutionary Computation Conference 2002, New York, July 2002.&lt;/li>
&lt;li>Referee for the 15th European Conference on Artificial Intelligence, Lyon, France, July 2002.&lt;/li>
&lt;li>Referee for the Journal of Heuristics, since September 2001.&lt;/li>
&lt;li>Referee for Applied Mathematics Letters (journal), since June 2001.&lt;/li>
&lt;li>Chair and proceeding&amp;rsquo;s editor of the Second European Workshop on Evolutionary Computation in Combinatorial Optimization 2002, Kinsale, Ireland, April 2002.&lt;/li>
&lt;li>Referee for Operations Research (INFORMS journal), since May 2001.&lt;/li>
&lt;li>Program committee member of the Seventh International Conference on Parallel Problem Solving from Nature, Granada, Spain, September 2002.&lt;/li>
&lt;li>Program committee member of the IEEE Congress on Evolutionary Computation, Hawaii, May 2002.&lt;/li>
&lt;li>Co-chair of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Madrid, Spain, March 2002.&lt;/li>
&lt;li>Chair and proceeding&amp;rsquo;s editor of the First European Workshop on Evolutionary Computation in Combinatorial Optimization 2001, Como, Italy, April 2001.&lt;/li>
&lt;li>Referee for the IEEE Transactions on Systems, Man, and Cybernetics (journal), IEEE Press, since March 2001.&lt;/li>
&lt;li>Referee for the European Symposium on Algorithms 2001, Aarhus, Denmark, August 2001&lt;/li>
&lt;li>Referee for the 5th World Multi-Conference on Systemics, Cybernetics and Informatics, Orlando, FL, July 2001.&lt;/li>
&lt;li>Referee for the Information Processing Letters (journal), Elsevier, since December 2000.&lt;/li>
&lt;li>Program committee member of the Genetic and Evolutionary Computation Conference 2001, San Francisco, CA, July 2001.&lt;/li>
&lt;li>Program committee member of the Workshop on Representations and Operators for Network Problems at the Genetic and Evolutionary Computation Conference 2001, San Francisco, CA, July 2001.&lt;/li>
&lt;li>Scientific board member of the 6th Online World Conference on Soft Computing in Industrial Applications, September 2001.&lt;/li>
&lt;li>Program committee member of the IEEE Congress on Evolutionary Computation, Seoul, Korea, May 2001.&lt;/li>
&lt;li>Referee for the IEEE Transactions on Evolutionary Computation (journal), IEEE Press, since September 2000.&lt;/li>
&lt;li>Co-chair of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Las Vegas, NV, March 2001.&lt;/li>
&lt;li>Program committee member of the International Symposium on Computational Intelligence, Kosice, Slovakia, September 2000.&lt;/li>
&lt;li>Program committee member of the Genetic and Evolutionary Computation Conference, Las Vegas, NV, July 2000.&lt;/li>
&lt;li>Referee for Information Science (journal), Elsevier Science, since May 2000.&lt;/li>
&lt;li>Co-chair of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Como, Italy, March 2000.&lt;/li>
&lt;li>Referee for The Computer Journal, Oxford University Press, since Dezember 1999.&lt;/li>
&lt;li>Program committee member of the Genetic and Evolutionary Computation Conference, Orlando, Florida, July 1999.&lt;/li>
&lt;li>Program committee member of the 3rd Int. Mendel Conference on Genetic Algorithms, Brno, Czech Republic, June 1999.&lt;/li>
&lt;li>Referee for the Computer Animation 99 conference, 1999.&lt;/li>
&lt;li>Associated node member of EvoNet (European Network of Excellence in Evolutionary Computation), since 1999.&lt;/li>
&lt;li>Co-editor of the proceedings of the Int. Conference on Imaging Science, Systems, and Technology, Las Vegas, NV, July 1998.&lt;/li>
&lt;li>Program committee member of the 7th International Conference on Intelligent Systems, Paris, France, July 1998.&lt;/li>
&lt;/ul>
&lt;hr>
&lt;p>&lt;a href="https://ac.tuwien.ac.at/team/guenther-raidl/">⬅ Back to Günter Raidl&amp;rsquo;s Profile&lt;/a>&lt;/p></description></item><item><title>A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximization</title><link>https://ac.tuwien.ac.at/publication/a-construct-merge-solve-and-adapt-heuristic-for-least-cost-influence-maximization/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-construct-merge-solve-and-adapt-heuristic-for-least-cost-influence-maximization/</guid><description/></item><item><title>A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs</title><link>https://ac.tuwien.ac.at/publication/a-denoising-diffusion-adaptive-search-for-the-alpha-domination-problem-on-social-graphs/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-denoising-diffusion-adaptive-search-for-the-alpha-domination-problem-on-social-graphs/</guid><description/></item><item><title>A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problem</title><link>https://ac.tuwien.ac.at/publication/a-denoising-diffusion-based-evolutionary-algorithm-framework-application-to-the-maximum-independent-set-problem/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-denoising-diffusion-based-evolutionary-algorithm-framework-application-to-the-maximum-independent-set-problem/</guid><description/></item><item><title>A Reinforcement Learning Guided Large Neighborhood Search for the Dynamic Electric Autonomous Dial-a-Ride Problem</title><link>https://ac.tuwien.ac.at/publication/a-reinforcement-learning-guided-large-neighborhood-search-for-the-dynamic-electric-autonomous-dial-a-ride-problem/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-reinforcement-learning-guided-large-neighborhood-search-for-the-dynamic-electric-autonomous-dial-a-ride-problem/</guid><description/></item><item><title>Annoyance Modeling in Cooperative Personnel Scheduling</title><link>https://ac.tuwien.ac.at/publication/annoyance-modeling-in-cooperative-personnel-scheduling/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/annoyance-modeling-in-cooperative-personnel-scheduling/</guid><description/></item><item><title>Dataset of Electric Autonomous Dial-a-Ride Instances with Local Energy Communities and Electricity Tariffs</title><link>https://ac.tuwien.ac.at/publication/dataset-of-electric-autonomous-dial-a-ride-instances-with-local-energy-communities-and-electricity-tariffs/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/dataset-of-electric-autonomous-dial-a-ride-instances-with-local-energy-communities-and-electricity-tariffs/</guid><description/></item><item><title>Determining Destroy Sets in Large Neighborhood Search by Generative Flow Networks</title><link>https://ac.tuwien.ac.at/publication/determining-destroy-sets-in-large-neighborhood-search-by-generative-flow-networks/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/determining-destroy-sets-in-large-neighborhood-search-by-generative-flow-networks/</guid><description/></item><item><title>Learning to Predict User Replies in Interactive Job Scheduling</title><link>https://ac.tuwien.ac.at/publication/learning-to-predict-user-replies-in-interactive-job-scheduling/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/learning-to-predict-user-replies-in-interactive-job-scheduling/</guid><description/></item><item><title>Pairwise Reflection Symmetry in Generalized Latin Rectangles</title><link>https://ac.tuwien.ac.at/publication/pairwise-reflection-symmetry-in-generalized-latin-rectangles/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/pairwise-reflection-symmetry-in-generalized-latin-rectangles/</guid><description/></item><item><title>Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs</title><link>https://ac.tuwien.ac.at/publication/putting-tutte-s-counterexample-to-tait-s-conjecture-in-perspective-to-hamiltonicity-and-non-hamiltonicity-in-certain-planar-cubic-graphs/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/putting-tutte-s-counterexample-to-tait-s-conjecture-in-perspective-to-hamiltonicity-and-non-hamiltonicity-in-certain-planar-cubic-graphs/</guid><description/></item><item><title>Revisiting Large Neighborhood Search with On-the-Fly ChargingStation Insertion for the Electric Autonomous Dial-a-Ride Problem</title><link>https://ac.tuwien.ac.at/publication/revisiting-large-neighborhood-search-with-on-the-fly-chargingstation-insertion-for-the-electric-autonomous-dial-a-ride-problem/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/revisiting-large-neighborhood-search-with-on-the-fly-chargingstation-insertion-for-the-electric-autonomous-dial-a-ride-problem/</guid><description/></item><item><title>SAT-Based Search for Minwise Independent Families</title><link>https://ac.tuwien.ac.at/publication/sat-based-search-for-minwise-independent-families/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/sat-based-search-for-minwise-independent-families/</guid><description/></item><item><title>Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problem</title><link>https://ac.tuwien.ac.at/publication/superstrings-of-uniform-cardinality-set-systems-via-the-generalized-traveling-salesperson-problem/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/superstrings-of-uniform-cardinality-set-systems-via-the-generalized-traveling-salesperson-problem/</guid><description/></item><item><title>The Graph Burning Problem under Constrained Diffusion</title><link>https://ac.tuwien.ac.at/publication/the-graph-burning-problem-under-constrained-diffusion/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-graph-burning-problem-under-constrained-diffusion/</guid><description/></item><item><title>A Hybrid CMSA–Column Generation Approach to Variable-Sized Bin Packing</title><link>https://ac.tuwien.ac.at/publication/a-hybrid-cmsa-column-generation-approach-to-variable-sized-bin-packing/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-hybrid-cmsa-column-generation-approach-to-variable-sized-bin-packing/</guid><description/></item><item><title>A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problem</title><link>https://ac.tuwien.ac.at/publication/a-learning-twolevel-optimization-approach-for-the-demand-maximizing-battery-swapping-station-location-problem/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-learning-twolevel-optimization-approach-for-the-demand-maximizing-battery-swapping-station-location-problem/</guid><description/></item><item><title>Complexity of Positive Influence Domination on Partial Grids</title><link>https://ac.tuwien.ac.at/publication/complexity-of-positive-influence-domination-on-partial-grids/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/complexity-of-positive-influence-domination-on-partial-grids/</guid><description/></item><item><title>Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem</title><link>https://ac.tuwien.ac.at/publication/genetic-programming-hyper-heuristic-for-the-dynamic-electric-dial-a-ride-problem/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/genetic-programming-hyper-heuristic-for-the-dynamic-electric-dial-a-ride-problem/</guid><description/></item><item><title>Improvements in Large Neighborhood Search for the Electric Autonomous Dial-a-Ride Problem</title><link>https://ac.tuwien.ac.at/publication/improvements-in-large-neighborhood-search-for-the-electric-autonomous-dial-a-ride-problem/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/improvements-in-large-neighborhood-search-for-the-electric-autonomous-dial-a-ride-problem/</guid><description/></item><item><title>Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding</title><link>https://ac.tuwien.ac.at/publication/learning-to-select-promising-initial-solutions-for-large-neighborhood-search-based-multi-agent-path-finding/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/learning-to-select-promising-initial-solutions-for-large-neighborhood-search-based-multi-agent-path-finding/</guid><description/></item><item><title>Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime</title><link>https://ac.tuwien.ac.at/publication/learning-value-functions-for-same-day-delivery-problems-in-the-tardiness-regime-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/learning-value-functions-for-same-day-delivery-problems-in-the-tardiness-regime-2/</guid><description/></item><item><title>Selecting User Queries in Interactive Job Scheduling</title><link>https://ac.tuwien.ac.at/publication/selecting-user-queries-in-interactive-job-scheduling/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/selecting-user-queries-in-interactive-job-scheduling/</guid><description/></item><item><title>Tackling the Alpha-Domination Problem Heuristically</title><link>https://ac.tuwien.ac.at/publication/tackling-the-alpha-domination-problem-heuristically/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/tackling-the-alpha-domination-problem-heuristically/</guid><description/></item><item><title>A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-for-solving-the-longest-common-square-subsequence-problem/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-for-solving-the-longest-common-square-subsequence-problem/</guid><description/></item><item><title>A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/a-neural-network-based-guidance-for-a-brkga-an-application-to-the-longest-common-square-subsequence-problem/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-neural-network-based-guidance-for-a-brkga-an-application-to-the-longest-common-square-subsequence-problem/</guid><description/></item><item><title>A Simulated Annealing Based Approach for the Roman Domination Problem</title><link>https://ac.tuwien.ac.at/publication/a-simulated-annealing-based-approach-for-the-roman-domination-problem/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-simulated-annealing-based-approach-for-the-roman-domination-problem/</guid><description/></item><item><title>Balancing Bicycle Sharing Systems</title><link>https://ac.tuwien.ac.at/project/balancing-bicycle-sharing-systems/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/balancing-bicycle-sharing-systems/</guid><description>&lt;ul>
&lt;li>Christian Kloimüllner&lt;/li>
&lt;li>Petrina Papazek&lt;/li>
&lt;li>Bin Hu&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/guenther-raidl/">Günther Raidl&lt;/a>&lt;/li>
&lt;/ul>
&lt;p>Public bicycle sharing systems are booming worldwide in many major&lt;br>
cities. Such systems augment public transport very well, are green&lt;br>
alternatives to motorized individual traffic, may decrease traffic jams&lt;br>
and parking problems in cities to a certain extent, and last but not&lt;br>
least are an incentive for sports and a significant contribution to&lt;br>
public health. Modern systems have automated rental stations&lt;br>
distributed over the (inner) districts of the city, and users can easily&lt;br>
rent bicycles and bring them back at any other stations.&lt;/p>
&lt;p>For user acceptance it is essential to provide enough bicycles as well&lt;br>
as parking slots for returning them at any station at almost all time.&lt;br>
As the usage pattern typically is not symmetric, e.g., people tend to&lt;br>
rent bikes at topographically higher stations and return them to lower&lt;br>
stations, an active maintenance by regularly transporting bikes from&lt;br>
some stations to others is crucial.&lt;/p>
&lt;p>Project partners:&lt;/p>
&lt;ul>
&lt;li>&lt;a href="http://www.ait.ac.at/" target="_blank" rel="noopener">Austrian Institute of Technology&lt;/a>&lt;/li>
&lt;li>&lt;a href="http://www.citybikewien.at/" target="_blank" rel="noopener">Citybike Wien&lt;/a>&lt;/li>
&lt;li>&lt;a href="http://www.enu.at/enu-english" target="_blank" rel="noopener">Energy and Environment Agency of Lower Austria&lt;/a>&lt;/li>
&lt;li>&lt;a href="http://www.diegm.uniud.it/digaspero/" target="_blank" rel="noopener">Luca Di Gaspero, University of Udine, Italy&lt;/a>&lt;/li>
&lt;/ul>
&lt;h2 id="problem-definition">Problem Definition&lt;/h2>
&lt;p>The balancing bike sharing systems (BBSS) problem consists of finding an optimal rebalancing plan for the operator that consists of&lt;/p>
&lt;ul>
&lt;li>a route for each vehicle on duty and&lt;/li>
&lt;li>loading instructions for each station on the route&lt;/li>
&lt;/ul>
&lt;p>so that the system is in a balanced condition afterwards, i.e., no station is overly full or empty.&lt;/p>
&lt;p>Two basic problem variants are considered:&lt;/p>
&lt;ul>
&lt;li>&lt;strong>Static case&lt;/strong>: The rebalancing process is done when the system is not used (e.g., overnight). Initial and target station fill levels are given as constants.&lt;/li>
&lt;li>&lt;strong>Dynamic case&lt;/strong>: The system is rebalanced while in use. Station fill levels are time-dependent and estimated by empirical data.&lt;/li>
&lt;/ul>
&lt;h2 id="approaches">Approaches&lt;/h2>
&lt;p>Exact approaches based on mixed integer programming:&lt;/p>
&lt;ul>
&lt;li>Hop index model&lt;/li>
&lt;li>Time index model&lt;/li>
&lt;/ul>
&lt;p>Construction heuristics:&lt;/p>
&lt;ul>
&lt;li>Greedy heuristic&lt;/li>
&lt;li>PILOT heuristic&lt;/li>
&lt;/ul>
&lt;p>Metaheuristic approaches:&lt;/p>
&lt;ul>
&lt;li>Variable neighborhood search approach&lt;/li>
&lt;li>GRASP approach&lt;/li>
&lt;li>Hybrid of GRASP with Path Relinking&lt;/li>
&lt;/ul>
&lt;p>Problem instances which we are using for our work can be found &lt;a href="https://ac.tuwien.ac.at/research/problem-instances/#bbss">here&lt;/a>.&lt;/p></description></item><item><title>Complete Solution Archives for Evolutionary Combinatorial Optimization</title><link>https://ac.tuwien.ac.at/project/solution-archives/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/solution-archives/</guid><description>&lt;ul>
&lt;li>Benjamin Biesinger&lt;/li>
&lt;li>Bin Hu&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/guenther-raidl/">Günther Raidl&lt;/a>&lt;/li>
&lt;/ul>
&lt;p>A common drawback of metaheuristic approaches, especially evolutionary algorithms (EAs) is that they usually do not keep track of the search history, and already evaluated solutions are often revisited. This leads to premature convergence, wasting resources for re-evaluations, and other malicious effects.&lt;/p>
&lt;p>
&lt;figure >
&lt;div class="d-flex justify-content-center">
&lt;div class="w-100" >&lt;img alt="Solution Archive Architecture"
src="https://ac.tuwien.ac.at/project/solution-archives/Ea-sa.gif"
loading="lazy" data-zoomable />&lt;/div>
&lt;/div>&lt;/figure>
&lt;/p>
&lt;p>The solution archive (SA) is a concept for dealing with this problem. By attaching it to a classical EA, it enables detecting already evaluated candidate solutions and efficiently transforming them into similar but yet unvisited solutions, i.e., performing an &amp;ldquo;intelligent mutation&amp;rdquo;. The figure above illustrates the cooperation between the EA and the archive.&lt;/p>
&lt;h2 id="application">Application&lt;/h2>
&lt;p>Since this concept causes additional overhead for inserting and transforming solutions in the SA data structure, following conditions should hold in order to maximize the efficiency:&lt;/p>
&lt;ul>
&lt;li>A &lt;strong>compact solution representation&lt;/strong> keeps memory consumption for the archive low.&lt;/li>
&lt;li>Problems with &lt;strong>expensive solution evaluations&lt;/strong> benefit most from avoiding re-evaluations.&lt;/li>
&lt;li>Problems with &lt;strong>few feasibility constraints&lt;/strong> so that the transformation procedure can be kept simple.&lt;/li>
&lt;/ul>
&lt;p>Following combinatorial optimization problems were particularly successful with this approach:&lt;/p>
&lt;ul>
&lt;li>Royal road functions&lt;/li>
&lt;li>NK landscapes&lt;/li>
&lt;li>Generalized minimum spanning tree problem&lt;/li>
&lt;li>(r|p)-centroid problem and other competitive facility location problem&lt;/li>
&lt;/ul></description></item><item><title>Cooperative Optimization Approaches for Distributing Service Points</title><link>https://ac.tuwien.ac.at/project/cooperative-optimization-approaches-for-distributing-service-points/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/cooperative-optimization-approaches-for-distributing-service-points/</guid><description>&lt;p>A joined research project from the Algorithms and Complexity Group, TU Wien, Austria, and &lt;a href="https://www.honda-ri.de/" target="_blank" rel="noopener">Honda Research Institute&lt;/a>, Germany&lt;/p>
&lt;h2 id="project-team">Project Team&lt;/h2>
&lt;ul>
&lt;li>Thomas Jatschka&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/guenther-raidl/">Günther Raidl&lt;/a>&lt;/li>
&lt;li>&lt;a href="https://www.honda-ri.de/" target="_blank" rel="noopener">Tobias Rodemann&lt;/a>&lt;/li>
&lt;/ul>
&lt;h2 id="topic">Topic&lt;/h2>
&lt;p>For many business models an optimal distribution of service points in a customer community is needed. Examples are charging/battery swapping stations of electric vehicles, bicycle/car sharing stations, and repair stations. When planning such systems, estimating under which conditions which customer demand can be fulfilled is fundamental in order to design and evaluate possible solutions. To this end, demographic data is usually interlinked with geographic information, data on public transport, the street network, knowledge on manifold special locations etc. Usually, the whole process is challenging and error-prone. Customer demand information determined in such ways typically is vague, and not uncommonly a system built on such assumptions is not as effective as originally hoped for due to major deviations in reality.&lt;/p>
&lt;p>To possibly improve this situation, we propose a cooperative optimization approach that incorporates potential users on a large scale and more tightly into the data acquisition as well as the optimization process. We confront the potential customers with certain location scenarios and ask them how these would suit his needs and how possibly these scenarios can be improved to fulfill more of his demand. This feedback is used to incrementally gain more knowledge about how much demand may be fulfilled under which conditions. New, more promising candidate location scenarios can then be derived and again be presented to the users. The process is iterated on a large scale with many potential users and many rounds until a satisfactory solution is reached.&lt;/p>
&lt;p>The figure below depicts the components of the framework of our cooperative optimization approach and their interaction. The general framework consists of the following components: an &lt;em>evaluation component&lt;/em> (EC), an &lt;em>optimization component&lt;/em> (OC), a &lt;em>feedback component&lt;/em> (FC), and a &lt;em>solution management component&lt;/em> (SMC).&lt;/p>
&lt;p>
&lt;figure >
&lt;div class="d-flex justify-content-center">
&lt;div class="w-100" >&lt;img alt="" srcset="
/project/cooperative-optimization-approaches-for-distributing-service-points/spdp_framework_components_hu1805187074826567040.webp 400w,
/project/cooperative-optimization-approaches-for-distributing-service-points/spdp_framework_components_hu2746234392990661387.webp 760w,
/project/cooperative-optimization-approaches-for-distributing-service-points/spdp_framework_components_hu1068991561313522421.webp 1200w"
src="https://ac.tuwien.ac.at/project/cooperative-optimization-approaches-for-distributing-service-points/spdp_framework_components_hu1805187074826567040.webp"
width="760"
height="365"
loading="lazy" data-zoomable />&lt;/div>
&lt;/div>&lt;/figure>
&lt;/p></description></item><item><title>Cooperative Personnel Scheduling</title><link>https://ac.tuwien.ac.at/project/cooperative-personnel-scheduling/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/cooperative-personnel-scheduling/</guid><description>&lt;p>a joined research project from the Algorithms and Complexity Group, TU Wien, Austria, and &lt;a href="https://www.honda-ri.de/" target="_blank" rel="noopener">Honda Research Institute&lt;/a>, Germany&lt;/p>
&lt;h2 id="project-team">Project Team&lt;/h2>
&lt;ul>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/johannes-varga/">Johannes Varga&lt;/a>&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/guenther-raidl/">Günther Raidl&lt;/a>&lt;/li>
&lt;li>&lt;a href="https://www.honda-ri.de/" target="_blank" rel="noopener">Tobias Rodemann&lt;/a>&lt;/li>
&lt;/ul>
&lt;h2 id="topic">Topic&lt;/h2>
&lt;p>In classical personnel scheduling, the employees of a company are assigned their schedules, which determine at which times they work to fulfill some kind of demand. Our setting is slightly different. Each employee also referred to as a user, has some jobs to complete that need a specific resource. Only a limited amount of resources is available and only one job can use a resource at a time. Each job has to be assigned to a resource and a timespan in which the job is carried out. Furthermore, users will have preferences on when their jobs should be executed. These preferences have to be collected in some way. One possibility would be to let the employees specify their full preferences in the beginning. But this is tedious for the employees, error-prone and only allows for preferences that were explicitly considered when designing the algorithm.&lt;/p>
&lt;p>In this project, we will develop and investigate a framework that learns these preferences over time through a limited amount of user interactions. The framework aims to construct schedules that respect employees&amp;rsquo; preferences and are feasible with the given restrictions. While constructing the schedules it is allowed to ask the employees a limited number of questions regarding their preferences. The responses to these questions are used to model the employees&amp;rsquo; preferences. The framework may also consider fairness, e.g. by balancing the number of user interactions among the employees. Research questions to answer include which algorithms work well for the occurring problems, how to model the employees&amp;rsquo; preferences, and which kind of user interaction gives sufficient information on the preferences, without overwhelming the employees.&lt;/p>
&lt;p>
&lt;figure >
&lt;div class="d-flex justify-content-center">
&lt;div class="w-100" >&lt;img src="visualization.png" alt="Framework Visualization" loading="lazy" data-zoomable />&lt;/div>
&lt;/div>&lt;/figure>
&lt;/p></description></item><item><title>Cutting and Packing Problems</title><link>https://ac.tuwien.ac.at/project/cutting-and-packing/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/cutting-and-packing/</guid><description>&lt;ul>
&lt;li>Frederico Dusberger&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/guenther-raidl/">Günther Raidl&lt;/a>&lt;/li>
&lt;/ul>
&lt;p>Cutting and packing problems occur in a multitude of industrial or other real-world applications such as&lt;/p>
&lt;ul>
&lt;li>glass, paper and steel cutting,&lt;/li>
&lt;li>container or pallet loading,&lt;/li>
&lt;li>VLSI design,&lt;/li>
&lt;li>and many other applications.&lt;/li>
&lt;/ul>
&lt;p>Usually items have to be cut from raw material and waste should be minimized, or the number of bins/containers needed to pack given items has to be minimized. In our research we dealt (until now) with two-dimensional bin packing problems where only guillotineable cutting/packing patterns are allowed.&lt;/p>
&lt;p>
&lt;figure >
&lt;div class="d-flex justify-content-center">
&lt;div class="w-100" >&lt;img alt="Cutting Example" srcset="
/project/cutting-and-packing/cutting_example_hu1170859832339616723.webp 400w,
/project/cutting-and-packing/cutting_example_hu462985882202238964.webp 760w,
/project/cutting-and-packing/cutting_example_hu3143147562818217407.webp 1200w"
src="https://ac.tuwien.ac.at/project/cutting-and-packing/cutting_example_hu1170859832339616723.webp"
width="452"
height="760"
loading="lazy" data-zoomable />&lt;/div>
&lt;/div>&lt;/figure>
&lt;/p>
&lt;p>Another kind of packing problems are the so called Knapsack Problems. Where items with an associated profit have to be packed into one or more knapsacks, and the profit has to be maximized. There are several variants of knapsack problems, such as the classical knapsack problem, multiconstrained knapsack problems, multiple knapsack problems, and many others. In our research we mainly deal with multiconstrained knapsack problems.&lt;/p>
&lt;p>Solving cutting and packing problems can be done in various ways, we developed metaheuristics and exact algorithms for dealing with those problems. Especially the combination of evolutionary algorithms with problem specific heuristics, local and global optimization techniques are considered. Please see also our page on metaheuristics and evolutionary computation and the page on hybrid optimization techniques.&lt;/p></description></item><item><title>Doctoral College Vienna Graduate School on Computational Optimization</title><link>https://ac.tuwien.ac.at/project/doctoral-college-vienna-graduate-school-on-computational-optimization/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/doctoral-college-vienna-graduate-school-on-computational-optimization/</guid><description/></item><item><title>Exact methods for the Selective Assessment Routing Problem</title><link>https://ac.tuwien.ac.at/publication/exact-methods-for-the-selective-assessment-routing-problem/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exact-methods-for-the-selective-assessment-routing-problem/</guid><description/></item><item><title>Large-Scale Radio Therapy Scheduling</title><link>https://ac.tuwien.ac.at/project/research-collaboration-with-medaustron/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/research-collaboration-with-medaustron/</guid><description>&lt;p>One of the most advanced medical centers for Ion Beam Therapy and Research in Europe is currently being built in Wiener Neustadt: MedAustron. The radiation therapies applied will use protons and carbon ions for cancer treatment. The first patient treatments are planned in 2016. In the full operational phase up to 1,200 people per year are expected to benefit from the international first class medicine offered by MedAustron.&lt;/p>
&lt;p>Scheduling patient treatments with their large number of individual tasks and specific requirements in order to best utilize the available resources and treat patients as soon and smoothly as possible is a huge challenge. The Algorithms and Complexity Group collaborates with MedAustron in the development of advanced scheduling algorithms and their software implementation to fulfill these needs and to give as many cancer patients as possible a new opportunity.&lt;/p>
&lt;p>Within the Algorithms and Complexity Group, &lt;a href="https://ac.tuwien.ac.at/team/guenther-raidl/">Günther Raidl&lt;/a> is leading this research effort.&lt;/p>
&lt;p>
&lt;figure >
&lt;div class="d-flex justify-content-center">
&lt;div class="w-100" >&lt;img alt="MedAustron Accelerator Facility" srcset="
/project/research-collaboration-with-medaustron/medaustron-beschleuniger_hu9697994152849803382.webp 400w,
/project/research-collaboration-with-medaustron/medaustron-beschleuniger_hu18047736225888196056.webp 760w,
/project/research-collaboration-with-medaustron/medaustron-beschleuniger_hu15050414677252912484.webp 1200w"
src="https://ac.tuwien.ac.at/project/research-collaboration-with-medaustron/medaustron-beschleuniger_hu9697994152849803382.webp"
width="760"
height="415"
loading="lazy" data-zoomable />&lt;/div>
&lt;/div>&lt;/figure>
&lt;/p></description></item><item><title>Learning to Solve Dynamic Vehicle Routing Problems</title><link>https://ac.tuwien.ac.at/project/learning-to-solve-dynamic-vehicle-routing-problems/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/learning-to-solve-dynamic-vehicle-routing-problems/</guid><description>&lt;p>a joined research project from the Algorithms and Complexity Group, TU Wien, Austria, and &lt;a href="https://www.honda-ri.de/" target="_blank" rel="noopener">Honda Research Institute&lt;/a>, Germany&lt;/p>
&lt;h2 id="project-team">Project Team&lt;/h2>
&lt;ul>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/maria-bresich/">Maria Bresich&lt;/a>&lt;/li>
&lt;li>&lt;a href="https://ac.tuwien.ac.at/team/guenther-raidl/">Günther Raidl&lt;/a>&lt;/li>
&lt;li>&lt;a href="https://www.honda-ri.de/people/" target="_blank" rel="noopener">Steffen Limmer&lt;/a>&lt;/li>
&lt;/ul>
&lt;h2 id="topic">Topic&lt;/h2>
&lt;p>Vehicle routing - i.e., planning an optimal set of routes for a fleet of vehicles - is an intensely studied research area with enormous practical and raising relevance due to increasing mobility and transportation demand and new challenges coming, e.g., from increasing interest in shared mobility services and electric vehicles. The dial-a-ride problem (DARP), for example, is the problem of finding optimal tours of vehicles through different pickup and drop-off locations in order to serve a number of transportation requests, allowing different customers to share a vehicle. The electric autonomous dial-a-ride problem (E-ADARP) represents a challenging and practically relevant extension to the DARP, where electric autonomous vehicles are employed and their charging requirements have to be taken into consideration. Furthermore, not only classical objectives like total travel time have to be optimized, but user inconvenience also plays an important role. Thus, factors such as user excess ride time, which is due to detours because of the ride-sharing, have to be taken into account.&lt;/p>
&lt;p>For such problems, heuristic optimization approaches are considered to be the means of choice due to a better scalability compared to exact approaches. In this project, we propose a heuristic framework based on large neighborhood search (LNS) to solve the E-ADARP, and we plan to tackle the issue of scalability by automatically designing, i.e., learning, efficient heuristics that either guide or possibly replace classical optimization techniques. We will investigate the usage of reinforcement learning with different machine learning models to dynamically select operators for the LNS from a set of possible operators during the optimization process. We intend to experimentally compare this approach to other learning techniques such as classical supervised learning, imitation learning, and Q learning.&lt;/p></description></item><item><title>Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion</title><link>https://ac.tuwien.ac.at/publication/letting-a-large-neighborhood-search-for-an-electric-dial-a-ride-problem-fly-on-the-fly-charging-station-insertion/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/letting-a-large-neighborhood-search-for-an-electric-dial-a-ride-problem-fly-on-the-fly-charging-station-insertion/</guid><description/></item><item><title>Matheuristics: Hybrid Optimization Algorithms for Transportation Problems with Mutltiple Visits</title><link>https://ac.tuwien.ac.at/project/matheuristics-hybrid-optimization-algorithms-for-transportation-problems-with-mutltiple-visits/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/matheuristics-hybrid-optimization-algorithms-for-transportation-problems-with-mutltiple-visits/</guid><description/></item><item><title>Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem</title><link>https://ac.tuwien.ac.at/publication/mixed-integer-linear-programming-based-large-neighborhood-search-approaches-for-the-directed-feedback-vertex-set-problem/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/mixed-integer-linear-programming-based-large-neighborhood-search-approaches-for-the-directed-feedback-vertex-set-problem/</guid><description/></item><item><title>Multi-Criteria Optimization of FTTx Networks</title><link>https://ac.tuwien.ac.at/project/ffg-i892-n23/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/ffg-i892-n23/</guid><description/></item><item><title>Optimization Challenges in the Future Federated Internet</title><link>https://ac.tuwien.ac.at/project/wwtf-ict-10-024/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/project/wwtf-ict-10-024/</guid><description/></item><item><title>Scheduling Jobs Using Queries to Interactively Learn Human Availability Times</title><link>https://ac.tuwien.ac.at/publication/scheduling-jobs-using-queries-to-interactively-learn-human-availability-times/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/scheduling-jobs-using-queries-to-interactively-learn-human-availability-times/</guid><description/></item><item><title>Signed Double Roman Domination on Cubic Graphs</title><link>https://ac.tuwien.ac.at/publication/signed-double-roman-domination-on-cubic-graphs/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/signed-double-roman-domination-on-cubic-graphs/</guid><description/></item><item><title>Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks</title><link>https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-strengthening-cuts-with-graph-neural-networks/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-strengthening-cuts-with-graph-neural-networks/</guid><description/></item><item><title>A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning</title><link>https://ac.tuwien.ac.at/publication/a-multilevel-optimization-approach-for-large-scale-battery-exchange-station-location-planning/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-multilevel-optimization-approach-for-large-scale-battery-exchange-station-location-planning/</guid><description/></item><item><title>A Policy-Based Learning Beam Search for Combinatorial Optimization</title><link>https://ac.tuwien.ac.at/publication/a-policy-based-learning-beam-search-for-combinatorial-optimization/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-policy-based-learning-beam-search-for-combinatorial-optimization/</guid><description/></item><item><title>A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-the-longest-common-subsequence-problem/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-the-longest-common-subsequence-problem/</guid><description/></item><item><title>An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-approach-for-scheduling-a-fleet-of-shared-electric-vehicles/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-approach-for-scheduling-a-fleet-of-shared-electric-vehicles/</guid><description/></item><item><title>Interactive Job Scheduling with Partially Known Personnel Availabilities</title><link>https://ac.tuwien.ac.at/publication/interactive-job-scheduling-with-partially-known-personnel-availabilities/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/interactive-job-scheduling-with-partially-known-personnel-availabilities/</guid><description/></item><item><title>Large Neighborhood Search for Electric Vehicle Fleet Scheduling</title><link>https://ac.tuwien.ac.at/publication/large-neighborhood-search-for-electric-vehicle-fleet-scheduling/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/large-neighborhood-search-for-electric-vehicle-fleet-scheduling/</guid><description/></item><item><title>Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines</title><link>https://ac.tuwien.ac.at/publication/multi-objective-policy-evolution-for-a-same-day-delivery-problem-with-soft-deadlines/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/multi-objective-policy-evolution-for-a-same-day-delivery-problem-with-soft-deadlines/</guid><description/></item><item><title>Optimizing the positions of battery swapping stations – Pilot Studies and Layout Optimization Algorithm</title><link>https://ac.tuwien.ac.at/publication/optimizing-the-positions-of-battery-swapping-stations-pilot-studies-and-layout-optimization-algorithm/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/optimizing-the-positions-of-battery-swapping-stations-pilot-studies-and-layout-optimization-algorithm/</guid><description/></item><item><title>A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters</title><link>https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-battery-swapping-station-location-planning-for-electric-scooters/</link><pubDate>Tue, 01 Feb 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-battery-swapping-station-location-planning-for-electric-scooters/</guid><description/></item><item><title>A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation</title><link>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation-2/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation-2/</guid><description/></item><item><title>A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation</title><link>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-shortest-common-supersequence-problem-guided-by-an-approximate-expected-length-calculation/</guid><description/></item><item><title>A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications</title><link>https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-a-cooperative-optimization-approach-to-distribute-service-points-in-mobility-applications/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-a-cooperative-optimization-approach-to-distribute-service-points-in-mobility-applications/</guid><description/></item><item><title>A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters</title><link>https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-battery-swapping-station-location-planning-for-electric-scooters-2/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-battery-swapping-station-location-planning-for-electric-scooters-2/</guid><description/></item><item><title>A Learning Large Neighborhood Search for the Staff Rerostering Problem</title><link>https://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem/</guid><description/></item><item><title>A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems</title><link>https://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-longest-common-subsequence-problems/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-longest-common-subsequence-problems/</guid><description/></item><item><title>Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet</title><link>https://ac.tuwien.ac.at/publication/computational-methods-for-scheduling-the-charging-and-assignment-of-an-on-site-shared-electric-vehicle-fleet/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/computational-methods-for-scheduling-the-charging-and-assignment-of-an-on-site-shared-electric-vehicle-fleet/</guid><description/></item><item><title>Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences</title><link>https://ac.tuwien.ac.at/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/</guid><description/></item><item><title>Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems</title><link>https://ac.tuwien.ac.at/publication/learning-beam-search-utilizing-machine-learning-to-guide-beam-search-for-solving-combinatorial-optimization-problems/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/learning-beam-search-utilizing-machine-learning-to-guide-beam-search-for-solving-combinatorial-optimization-problems/</guid><description/></item><item><title>Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime</title><link>https://ac.tuwien.ac.at/publication/learning-value-functions-for-same-day-delivery-problems-in-the-tardiness-regime/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/learning-value-functions-for-same-day-delivery-problems-in-the-tardiness-regime/</guid><description/></item><item><title>Parallel Beam Search for Combinatorial Optimization</title><link>https://ac.tuwien.ac.at/publication/parallel-beam-search-for-combinatorial-optimization/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parallel-beam-search-for-combinatorial-optimization/</guid><description/></item><item><title>A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications</title><link>https://ac.tuwien.ac.at/publication/a-general-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-general-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications-2/</guid><description/></item><item><title>A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications</title><link>https://ac.tuwien.ac.at/publication/a-general-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-general-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/</guid><description/></item><item><title>A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources</title><link>https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/</guid><description/></item><item><title>A*-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem/</guid><description/></item><item><title>Driver Shift Planning for an Online Store with Short Delivery Times</title><link>https://ac.tuwien.ac.at/publication/driver-shift-planning-for-an-online-store-with-short-delivery-times/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/driver-shift-planning-for-an-online-store-with-short-delivery-times/</guid><description/></item><item><title>Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems</title><link>https://ac.tuwien.ac.at/publication/learning-surrogate-functions-for-the-short-horizon-planning-in-same-day-delivery-problems-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/learning-surrogate-functions-for-the-short-horizon-planning-in-same-day-delivery-problems-2/</guid><description/></item><item><title>Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems</title><link>https://ac.tuwien.ac.at/publication/learning-surrogate-functions-for-the-short-horizon-planning-in-same-day-delivery-problems/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/learning-surrogate-functions-for-the-short-horizon-planning-in-same-day-delivery-problems/</guid><description/></item><item><title>Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources</title><link>https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/</guid><description/></item><item><title>Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines</title><link>https://ac.tuwien.ac.at/publication/route-duration-prediction-in-a-stochastic-and-dynamic-vehicle-routing-problem-with-short-delivery-deadlines/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/route-duration-prediction-in-a-stochastic-and-dynamic-vehicle-routing-problem-with-short-delivery-deadlines/</guid><description/></item><item><title>Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers</title><link>https://ac.tuwien.ac.at/publication/smart-charging-of-electric-vehicles-considering-soc-dependent-maximum-charging-powers-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/smart-charging-of-electric-vehicles-considering-soc-dependent-maximum-charging-powers-2/</guid><description/></item><item><title>Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers</title><link>https://ac.tuwien.ac.at/publication/smart-charging-of-electric-vehicles-considering-soc-dependent-maximum-charging-powers/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/smart-charging-of-electric-vehicles-considering-soc-dependent-maximum-charging-powers/</guid><description/></item><item><title>Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings</title><link>https://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/</guid><description/></item><item><title>Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings</title><link>https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/</guid><description/></item><item><title>Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings</title><link>https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/</guid><description/></item><item><title>A Beam Search Approach to the Traveling Tournament Problem</title><link>https://ac.tuwien.ac.at/publication/a-beam-search-approach-to-the-traveling-tournament-problem/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-beam-search-approach-to-the-traveling-tournament-problem/</guid><description/></item><item><title>A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation</title><link>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-longest-common-subsequence-problem-guided-by-a-novel-approximate-expected-length-calculation/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-beam-search-for-the-longest-common-subsequence-problem-guided-by-a-novel-approximate-expected-length-calculation/</guid><description/></item><item><title>A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility</title><link>https://ac.tuwien.ac.at/publication/a-double-horizon-approach-to-a-purely-dynamic-and-stochastic-vehicle-routing-problem-with-delivery-deadlines-and-shift-flexibility/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-double-horizon-approach-to-a-purely-dynamic-and-stochastic-vehicle-routing-problem-with-delivery-deadlines-and-shift-flexibility/</guid><description/></item><item><title>A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources</title><link>https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-distributing-service-points-in-mobility-applications-with-capacities-and-limited-resources/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-distributing-service-points-in-mobility-applications-with-capacities-and-limited-resources/</guid><description/></item><item><title>A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three</title><link>https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three/</guid><description/></item><item><title>A Model for Finding Transition-Minors</title><link>https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors/</guid><description/></item><item><title>A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem</title><link>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-job-sequencing-with-one-common-and-multiple-secondary-resources-problem/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-job-sequencing-with-one-common-and-multiple-secondary-resources-problem/</guid><description/></item><item><title>An A* Search Algorithm for the Constrained Longest Common Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem-2/</guid><description/></item><item><title>An A* Search Algorithm for the Constrained Longest Common Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem/</guid><description/></item><item><title>An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem-2/</guid><description/></item><item><title>Anytime Algorithms for the Longest Common Palindromic Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem/</guid><description/></item><item><title>Casual Employee Scheduling with Constraint Programming and Metaheuristics</title><link>https://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-metaheuristics/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-metaheuristics/</guid><description/></item><item><title>Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem</title><link>https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem-2/</guid><description/></item><item><title>Distributing Battery Swapping Stations for Electric Scooters in an Urban Area</title><link>https://ac.tuwien.ac.at/publication/distributing-battery-swapping-stations-for-electric-scooters-in-an-urban-area/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/distributing-battery-swapping-stations-for-electric-scooters-in-an-urban-area/</guid><description/></item><item><title>Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications</title><link>https://ac.tuwien.ac.at/publication/exploiting-similar-behavior-of-users-in-a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exploiting-similar-behavior-of-users-in-a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/</guid><description/></item><item><title>Finding Longest Common Subsequences: New anytime A$^*$ Search Results</title><link>https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-anytime-a-search-results/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-anytime-a-search-results/</guid><description/></item><item><title>Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers</title><link>https://ac.tuwien.ac.at/publication/merging-quality-estimation-for-binary-decision-diagrams-with-binary-classifiers/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/merging-quality-estimation-for-binary-decision-diagrams-with-binary-classifiers/</guid><description/></item><item><title>On Solving a Generalized Constrained Longest Common Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/on-solving-a-generalized-constrained-longest-common-subsequence-problem/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-solving-a-generalized-constrained-longest-common-subsequence-problem/</guid><description/></item><item><title>On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences</title><link>https://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/</guid><description/></item><item><title>Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem</title><link>https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem-2/</guid><description/></item><item><title>Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem</title><link>https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/</guid><description/></item><item><title>VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points</title><link>https://ac.tuwien.ac.at/publication/vns-and-pbig-as-optimization-cores-in-a-cooperative-optimization-approach-for-distributing-service-points/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/vns-and-pbig-as-optimization-cores-in-a-cooperative-optimization-approach-for-distributing-service-points/</guid><description/></item><item><title>VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points</title><link>https://ac.tuwien.ac.at/publication/vns-and-pbig-as-optimization-cores-in-a-cooperative-optimization-approach-for-distributing-service-points-2/</link><pubDate>Fri, 01 Feb 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/vns-and-pbig-as-optimization-cores-in-a-cooperative-optimization-approach-for-distributing-service-points-2/</guid><description/></item><item><title>A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-with-rollout-evaluations-for-the-resource-constraint-job-scheduling-problem/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-with-rollout-evaluations-for-the-resource-constraint-job-scheduling-problem/</guid><description/></item><item><title>A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications</title><link>https://ac.tuwien.ac.at/publication/a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-cooperative-optimization-approach-for-distributing-service-points-in-mobility-applications/</guid><description/></item><item><title>A Heuristic Approach for Solving the Longest Common Square Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem-2/</guid><description/></item><item><title>A Heuristic Approach for Solving the Longest Common Square Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem/</guid><description/></item><item><title>A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three</title><link>https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three-2/</guid><description/></item><item><title>A Memetic Algorithm for Competitive Facility Location Problems</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-competitive-facility-location-problems/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-competitive-facility-location-problems/</guid><description/></item><item><title>A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems</title><link>https://ac.tuwien.ac.at/publication/a-novel-approach-for-solving-large-scale-bike-sharing-station-planning-problems/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-novel-approach-for-solving-large-scale-bike-sharing-station-planning-problems/</guid><description/></item><item><title>A SAT Approach for Finding Sup-Transition-Minors</title><link>https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors/</guid><description/></item><item><title>A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources</title><link>https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/</guid><description/></item><item><title>Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization</title><link>https://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-ant-colony-optimization/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-ant-colony-optimization/</guid><description/></item><item><title>Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem</title><link>https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem/</guid><description/></item><item><title>Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-the-longest-common-palindromic-subsequence-problem/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-the-longest-common-palindromic-subsequence-problem/</guid><description/></item><item><title>Finding Longest Common Subsequences: New A* Anytime Results</title><link>https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-a-anytime-results/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-a-anytime-results/</guid><description/></item><item><title>Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm</title><link>https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-an-a-beam-search-based-anytime-algorithm/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-an-a-beam-search-based-anytime-algorithm/</guid><description/></item><item><title>Metaheuristic Hybrids</title><link>https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/</guid><description/></item><item><title>Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources</title><link>https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/</guid><description/></item><item><title>Strategies for Iteratively Refining Layered Graph Models</title><link>https://ac.tuwien.ac.at/publication/strategies-for-iteratively-refining-layered-graph-models/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/strategies-for-iteratively-refining-layered-graph-models/</guid><description/></item><item><title>Towards Improving Merging Heuristics for Binary Decision Diagrams</title><link>https://ac.tuwien.ac.at/publication/towards-improving-merging-heuristics-for-binary-decision-diagrams/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/towards-improving-merging-heuristics-for-binary-decision-diagrams/</guid><description/></item><item><title>A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands</title><link>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands-2/</guid><description/></item><item><title>A Model for Finding Transition-Minors</title><link>https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors-2/</guid><description/></item><item><title>A SAT Approach for Finding Sup-Transition-Minors</title><link>https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors-2/</guid><description/></item><item><title>A*-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem-2/</guid><description/></item><item><title>An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows</title><link>https://ac.tuwien.ac.at/publication/an-a-algorithm-for-solving-a-prize-collecting-sequencing-problem-with-one-common-and-multiple-secondary-resources-and-time-windows/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-a-algorithm-for-solving-a-prize-collecting-sequencing-problem-with-one-common-and-multiple-secondary-resources-and-time-windows/</guid><description/></item><item><title>Anytime Algorithms for the Longest Common Palindromic Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem-2/</guid><description/></item><item><title>Finding Smooth Graphs with Small Independence Numbers</title><link>https://ac.tuwien.ac.at/publication/finding-smooth-graphs-with-small-independence-numbers/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/finding-smooth-graphs-with-small-independence-numbers/</guid><description/></item><item><title>GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection</title><link>https://ac.tuwien.ac.at/publication/grasp-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/grasp-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/</guid><description/></item><item><title>Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem</title><link>https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-a-prize-collecting-sequencing-problem/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/multivalued-decision-diagrams-for-a-prize-collecting-sequencing-problem/</guid><description/></item><item><title>Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments</title><link>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-with-limited-starting-time-variations-of-daily-treatments/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-with-limited-starting-time-variations-of-daily-treatments/</guid><description/></item><item><title>Semi-Automated Location Planning for Urban Bike-Sharing Systems</title><link>https://ac.tuwien.ac.at/publication/semi-automated-location-planning-for-urban-bike-sharing-systems/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/semi-automated-location-planning-for-urban-bike-sharing-systems/</guid><description/></item><item><title>Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition</title><link>https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition/</guid><description/></item><item><title>Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging</title><link>https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-2/</guid><description/></item><item><title>A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem</title><link>https://ac.tuwien.ac.at/publication/a-logic-based-benders-decomposition-approach-for-the-3-staged-strip-packing-problem/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-logic-based-benders-decomposition-approach-for-the-3-staged-strip-packing-problem/</guid><description/></item><item><title>A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem</title><link>https://ac.tuwien.ac.at/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem/</guid><description/></item><item><title>An Iterative Time-Bucket Refinement Algorithm for a High Resolution Resource-Constrained Project Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem/</guid><description/></item><item><title>Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control</title><link>https://ac.tuwien.ac.at/publication/efficient-consideration-of-soft-time-windows-in-a-large-neighborhood-search-for-the-districting-and-routing-problem-for-security-control/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/efficient-consideration-of-soft-time-windows-in-a-large-neighborhood-search-for-the-districting-and-routing-problem-for-security-control/</guid><description/></item><item><title>Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition</title><link>https://ac.tuwien.ac.at/publication/full-load-route-planning-for-balancing-bike-sharing-systems-by-logic-based-benders-decomposition/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/full-load-route-planning-for-balancing-bike-sharing-systems-by-logic-based-benders-decomposition/</guid><description/></item><item><title>GRASP and VNS for a Periodic VRP with Time Windows to Deal with Milk Collection</title><link>https://ac.tuwien.ac.at/publication/grasp-and-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/grasp-and-vns-for-a-periodic-vrp-with-time-windows-to-deal-with-milk-collection/</guid><description/></item><item><title>Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem</title><link>https://ac.tuwien.ac.at/publication/hierarchical-clustering-and-multilevel-refinement-for-the-bike-sharing-station-planning-problem/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hierarchical-clustering-and-multilevel-refinement-for-the-bike-sharing-station-planning-problem/</guid><description/></item><item><title>Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment</title><link>https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-a-problem-motivated-from-particle-therapy-for-cancer-treatment/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-a-problem-motivated-from-particle-therapy-for-cancer-treatment/</guid><description/></item><item><title>Large Neighborhood Search for the Most Strings with Few Bad Columns Problem</title><link>https://ac.tuwien.ac.at/publication/large-neighborhood-search-for-the-most-strings-with-few-bad-columns-problem/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/large-neighborhood-search-for-the-most-strings-with-few-bad-columns-problem/</guid><description/></item><item><title>Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments</title><link>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-time-estimation-to-schedule-sets-of-treatments/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-time-estimation-to-schedule-sets-of-treatments/</guid><description/></item><item><title>Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging</title><link>https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging/</guid><description/></item><item><title>Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm</title><link>https://ac.tuwien.ac.at/publication/solving-the-two-state-fixed-charge-transportation-problem-with-a-hybrid-genetic-algorithm/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-two-state-fixed-charge-transportation-problem-with-a-hybrid-genetic-algorithm/</guid><description/></item><item><title>A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands</title><link>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands/</guid><description/></item><item><title>A Memetic Algorithm for the Virtual Network Mapping Problem</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem-2/</guid><description/></item><item><title>A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design</title><link>https://ac.tuwien.ac.at/publication/a-multi-commodity-flow-based-model-for-multi-layer-hierarchical-ring-network-design/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-multi-commodity-flow-based-model-for-multi-layer-hierarchical-ring-network-design/</guid><description/></item><item><title>An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands</title><link>https://ac.tuwien.ac.at/publication/an-integer-l-shaped-method-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-integer-l-shaped-method-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/</guid><description/></item><item><title>Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem</title><link>https://ac.tuwien.ac.at/publication/computational-performance-evaluation-of-two-integer-linear-programming-models-for-the-minimum-common-string-partition-problem/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/computational-performance-evaluation-of-two-integer-linear-programming-models-for-the-minimum-common-string-partition-problem/</guid><description/></item><item><title>Districting and Routing for Security Control</title><link>https://ac.tuwien.ac.at/publication/districting-and-routing-for-security-control/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/districting-and-routing-for-security-control/</guid><description/></item><item><title>Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers</title><link>https://ac.tuwien.ac.at/publication/finding-uniquely-hamiltonian-graphs-of-minimum-degree-three-with-small-crossing-numbers/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/finding-uniquely-hamiltonian-graphs-of-minimum-degree-three-with-small-crossing-numbers/</guid><description/></item><item><title>Hybrid Metaheuristics – Powerful Tools for Optimization</title><link>https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-powerful-tools-for-optimization/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-powerful-tools-for-optimization/</guid><description/></item><item><title>Models and Algorithms for Competitive Facility Location Problems with Different Customer Behavior</title><link>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-competitive-facility-location-problems-with-different-customer-behavior/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-competitive-facility-location-problems-with-different-customer-behavior/</guid><description/></item><item><title>New Developments in Metaheuristics and their Applications – Selected Extended Contributions from the 10th Metaheuristics International Conference (MIC~2013)</title><link>https://ac.tuwien.ac.at/publication/new-developments-in-metaheuristics-and-their-applications-selected-extended-contributions-from-the-10th-metaheuristics-international-conference-mic-2013/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/new-developments-in-metaheuristics-and-their-applications-selected-extended-contributions-from-the-10th-metaheuristics-international-conference-mic-2013/</guid><description/></item><item><title>Particle Therapy Patient Scheduling: First Heuristic Approaches</title><link>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-first-heuristic-approaches/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-first-heuristic-approaches/</guid><description/></item><item><title>Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition</title><link>https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition-2/</guid><description/></item><item><title>Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics</title><link>https://ac.tuwien.ac.at/publication/time-bucket-relaxation-based-mixed-integer-programming-models-for-scheduling-problems-a-promising-starting-point-for-matheuristics/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/time-bucket-relaxation-based-mixed-integer-programming-models-for-scheduling-problems-a-promising-starting-point-for-matheuristics/</guid><description/></item><item><title>Numerical Optimisation of Electro-Hybrid Powertrains</title><link>https://ac.tuwien.ac.at/publication/numerical-optimisation-of-electro-hybrid-powertrains/</link><pubDate>Sun, 01 Mar 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/numerical-optimisation-of-electro-hybrid-powertrains/</guid><description/></item><item><title>Numerische Optimierung elektrifizierter Antriebsstränge</title><link>https://ac.tuwien.ac.at/publication/numerische-optimierung-elektrifizierter-antriebsstrange/</link><pubDate>Sun, 01 Mar 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/numerische-optimierung-elektrifizierter-antriebsstrange/</guid><description/></item><item><title>A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems</title><link>https://ac.tuwien.ac.at/publication/a-cluster-first-route-second-approach-for-balancing-bicycle-sharing-systems/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-cluster-first-route-second-approach-for-balancing-bicycle-sharing-systems/</guid><description/></item><item><title>A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problem</title><link>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-the-capacity-and-distance-constrained-plant-location-problem/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-the-capacity-and-distance-constrained-plant-location-problem/</guid><description/></item><item><title>A Hybrid Genetic Algorithm with Solution Archive for the Discrete (r|p)-Centroid Problem</title><link>https://ac.tuwien.ac.at/publication/a-hybrid-genetic-algorithm-with-solution-archive-for-the-discrete-r-p-centroid-problem/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-hybrid-genetic-algorithm-with-solution-archive-for-the-discrete-r-p-centroid-problem/</guid><description/></item><item><title>A New Solution Representation for the Firefighter Problem</title><link>https://ac.tuwien.ac.at/publication/a-new-solution-representation-for-the-firefighter-problem/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-new-solution-representation-for-the-firefighter-problem/</guid><description/></item><item><title>A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles</title><link>https://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles-2/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles-2/</guid><description/></item><item><title>A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles</title><link>https://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles/</guid><description/></item><item><title>A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size</title><link>https://ac.tuwien.ac.at/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem-with-variable-sheet-size/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-scalable-approach-for-the-k-staged-two-dimensional-cutting-stock-problem-with-variable-sheet-size/</guid><description/></item><item><title>A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size</title><link>https://ac.tuwien.ac.at/publication/a-value-correction-construction-heuristic-for-the-two-dimensional-cutting-stock-problem-with-variable-sheet-size/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-value-correction-construction-heuristic-for-the-two-dimensional-cutting-stock-problem-with-variable-sheet-size/</guid><description/></item><item><title>A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands</title><link>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/</guid><description/></item><item><title>CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem</title><link>https://ac.tuwien.ac.at/publication/cpu-versus-gpu-parallelization-of-an-ant-colony-optimization-for-the-longest-common-subsequence-problem/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/cpu-versus-gpu-parallelization-of-an-ant-colony-optimization-for-the-longest-common-subsequence-problem/</guid><description/></item><item><title>Decomposition Based Hybrid Metaheuristics</title><link>https://ac.tuwien.ac.at/publication/decomposition-based-hybrid-metaheuristics/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/decomposition-based-hybrid-metaheuristics/</guid><description/></item><item><title>Heuristic Approaches for the Probabilistic Traveling Salesman Problem</title><link>https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem-2/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem-2/</guid><description/></item><item><title>Heuristic Approaches for the Probabilistic Traveling Salesman Problem</title><link>https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem/</guid><description/></item><item><title>Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/metaheuristics-for-solving-a-multimodal-home-healthcare-scheduling-problem/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/metaheuristics-for-solving-a-multimodal-home-healthcare-scheduling-problem/</guid><description/></item><item><title>Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem</title><link>https://ac.tuwien.ac.at/publication/metaheuristics-for-the-two-dimensional-container-pre-marshalling-problem/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/metaheuristics-for-the-two-dimensional-container-pre-marshalling-problem/</guid><description/></item><item><title>On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics</title><link>https://ac.tuwien.ac.at/publication/on-solving-the-most-strings-with-few-bad-columns-problem-an-ilp-model-and-heuristics/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-solving-the-most-strings-with-few-bad-columns-problem-an-ilp-model-and-heuristics/</guid><description/></item><item><title>On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem</title><link>https://ac.tuwien.ac.at/publication/on-the-comparison-of-decoding-strategies-for-a-memetic-algorithm-for-the-multi-layer-hierarchical-ring-network-design-problem/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-comparison-of-decoding-strategies-for-a-memetic-algorithm-for-the-multi-layer-hierarchical-ring-network-design-problem/</guid><description/></item><item><title>PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems</title><link>https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/</guid><description/></item><item><title>Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/solving-the-3-staged-2-dimensional-cutting-stock-problem-by-dynamic-programming-and-variable-neighborhood-search/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-3-staged-2-dimensional-cutting-stock-problem-by-dynamic-programming-and-variable-neighborhood-search/</guid><description/></item><item><title>A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure</title><link>https://ac.tuwien.ac.at/publication/a-metaheuristic-approach-for-integrated-timetable-based-design-of-railway-infrastructure/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-metaheuristic-approach-for-integrated-timetable-based-design-of-railway-infrastructure/</guid><description/></item><item><title>A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem</title><link>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/</guid><description/></item><item><title>An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-leader-follower-facility-location-problem-with-proportional-customer-behavior/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-leader-follower-facility-location-problem-with-proportional-customer-behavior/</guid><description/></item><item><title>Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid</title><link>https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-analysis-of-path-relinking-and-recombination-within-a-grasp-hybrid/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-analysis-of-path-relinking-and-recombination-within-a-grasp-hybrid/</guid><description/></item><item><title>Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case</title><link>https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/</guid><description/></item><item><title>Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/boosting-an-exact-logic-based-benders-decomposition-approach-by-variable-neighborhood-search/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/boosting-an-exact-logic-based-benders-decomposition-approach-by-variable-neighborhood-search/</guid><description/></item><item><title>Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles</title><link>https://ac.tuwien.ac.at/publication/reducing-the-number-of-simulations-in-operation-strategy-optimization-for-hybrid-electric-vehicles/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/reducing-the-number-of-simulations-in-operation-strategy-optimization-for-hybrid-electric-vehicles/</guid><description/></item><item><title>Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem</title><link>https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/</guid><description/></item><item><title>Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure</title><link>https://ac.tuwien.ac.at/publication/variable-neighbourhood-search-for-integrated-timetable-design-of-railway-infrastructure/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighbourhood-search-for-integrated-timetable-design-of-railway-infrastructure/</guid><description/></item><item><title>A Memetic Algorithm for the Partition Graph Coloring Problem</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-partition-graph-coloring-problem/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-partition-graph-coloring-problem/</guid><description/></item><item><title>A Memetic Algorithm for the Virtual Network Mapping Problem</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-virtual-network-mapping-problem/</guid><description/></item><item><title>A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-two-distinct-solution-representations-for-the-partition-graph-coloring-problem/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-two-distinct-solution-representations-for-the-partition-graph-coloring-problem/</guid><description/></item><item><title>A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem</title><link>https://ac.tuwien.ac.at/publication/a-mixed-integer-model-for-the-stamina-aware-sightseeing-tour-problem/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-mixed-integer-model-for-the-stamina-aware-sightseeing-tour-problem/</guid><description/></item><item><title>A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems</title><link>https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/</guid><description/></item><item><title>A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems</title><link>https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-the-static-balancing-of-public-bicycle-sharing-systems/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-the-static-balancing-of-public-bicycle-sharing-systems/</guid><description/></item><item><title>A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables</title><link>https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables-2/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables-2/</guid><description/></item><item><title>An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure</title><link>https://ac.tuwien.ac.at/publication/an-optimization-model-for-integrated-timetable-based-design-of-railway-infrastructure/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-optimization-model-for-integrated-timetable-based-design-of-railway-infrastructure/</guid><description/></item><item><title>Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach</title><link>https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-a-variable-neighborhood-search-approach/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-a-variable-neighborhood-search-approach/</guid><description/></item><item><title>Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations</title><link>https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/</guid><description/></item><item><title>Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem</title><link>https://ac.tuwien.ac.at/publication/clique-and-independent-set-based-grasp-approaches-for-the-regenerator-location-problem/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/clique-and-independent-set-based-grasp-approaches-for-the-regenerator-location-problem/</guid><description/></item><item><title>Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents</title><link>https://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/</guid><description/></item><item><title>GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem</title><link>https://ac.tuwien.ac.at/publication/grasp-and-variable-neighborhood-search-for-the-virtual-network-mapping-problem/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/grasp-and-variable-neighborhood-search-for-the-virtual-network-mapping-problem/</guid><description/></item><item><title>PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems</title><link>https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/</guid><description/></item><item><title>Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive</title><link>https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-with-a-genetic-algorithm-with-solution-archive/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-with-a-genetic-algorithm-with-solution-archive/</guid><description/></item><item><title>Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent</title><link>https://ac.tuwien.ac.at/publication/solving-the-virtual-network-mapping-problem-with-construction-heuristics-local-search-and-variable-neighborhood-descent/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-virtual-network-mapping-problem-with-construction-heuristics-local-search-and-variable-neighborhood-descent/</guid><description/></item><item><title>Stabilizing Branch-and-Price for Constrained Tree Problems</title><link>https://ac.tuwien.ac.at/publication/stabilizing-branch-and-price-for-constrained-tree-problems/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/stabilizing-branch-and-price-for-constrained-tree-problems/</guid><description/></item><item><title>Using Optimized Virtual Network Embedding for Network Dimensioning</title><link>https://ac.tuwien.ac.at/publication/using-optimized-virtual-network-embedding-for-network-dimensioning/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/using-optimized-virtual-network-embedding-for-network-dimensioning/</guid><description/></item><item><title>A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-and-a-solution-archive-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-and-a-solution-archive-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</guid><description/></item><item><title>A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/</guid><description/></item><item><title>A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem</title><link>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-the-two-echelon-location-routing-problem/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-the-two-echelon-location-routing-problem/</guid><description/></item><item><title>An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem-2/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem-2/</guid><description/></item><item><title>An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archives-and-bounding-extension-for-the-generalized-minimum-spanning-tree-problem/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archives-and-bounding-extension-for-the-generalized-minimum-spanning-tree-problem/</guid><description/></item><item><title>Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles</title><link>https://ac.tuwien.ac.at/publication/applying-hybrid-metaheuristics-to-fuel-consumption-optimization-of-hybrid-electric-vehicles/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/applying-hybrid-metaheuristics-to-fuel-consumption-optimization-of-hybrid-electric-vehicles/</guid><description/></item><item><title>Automatic Generation of 2-AntWars Players with Genetic Programming</title><link>https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-2/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-2/</guid><description/></item><item><title>Hybrid Heuristics for Multimodal Homecare Scheduling</title><link>https://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hybrid-heuristics-for-multimodal-homecare-scheduling/</guid><description/></item><item><title>Improved Packing and Routing of Vehicles with Compartments</title><link>https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments-2/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments-2/</guid><description/></item><item><title>On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem</title><link>https://ac.tuwien.ac.at/publication/on-solving-the-rooted-delay-and-delay-variation-constrained-steiner-tree-problem/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-solving-the-rooted-delay-and-delay-variation-constrained-steiner-tree-problem/</guid><description/></item><item><title>Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization</title><link>https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization-2/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization-2/</guid><description/></item><item><title>Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location</title><link>https://ac.tuwien.ac.at/publication/variable-neighborhood-and-greedy-randomized-adaptive-search-for-capacitated-connected-facility-location/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighborhood-and-greedy-randomized-adaptive-search-for-capacitated-connected-facility-location/</guid><description/></item><item><title>Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design</title><link>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-grasp-for-three-layer-hierarchical-ring-network-design/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-grasp-for-three-layer-hierarchical-ring-network-design/</guid><description/></item><item><title>Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem</title><link>https://ac.tuwien.ac.at/publication/stabilized-branch-and-price-for-the-rooted-delay-constrained-steiner-tree-problem/</link><pubDate>Wed, 01 Jun 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/stabilized-branch-and-price-for-the-rooted-delay-constrained-steiner-tree-problem/</guid><description/></item><item><title>Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem</title><link>https://ac.tuwien.ac.at/publication/stabilized-column-generation-for-the-rooted-delay-constrained-steiner-tree-problem/</link><pubDate>Sun, 01 May 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/stabilized-column-generation-for-the-rooted-delay-constrained-steiner-tree-problem/</guid><description/></item><item><title>A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application</title><link>https://ac.tuwien.ac.at/publication/a-branch-and-cut-and-price-algorithm-for-a-fingerprint-template-compression-application/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-branch-and-cut-and-price-algorithm-for-a-fingerprint-template-compression-application/</guid><description/></item><item><title>A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems</title><link>https://ac.tuwien.ac.at/publication/a-layered-graph-model-and-an-adaptive-layers-framework-to-solve-delay-constrained-minimum-tree-problems/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-layered-graph-model-and-an-adaptive-layers-framework-to-solve-delay-constrained-minimum-tree-problems/</guid><description/></item><item><title>A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-multilevel-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</guid><description/></item><item><title>A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables</title><link>https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables/</guid><description/></item><item><title>An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem/</guid><description/></item><item><title>Automatic Generation of 2-AntWars Players with Genetic Programming</title><link>https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming/</guid><description/></item><item><title>Branch-and-Cut-and-Price for Capacitated Connected Facility Location</title><link>https://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location-2/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location-2/</guid><description/></item><item><title>Hybrid Metaheuristics in Combinatorial Optimization: A Survey</title><link>https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-in-combinatorial-optimization-a-survey/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-in-combinatorial-optimization-a-survey/</guid><description/></item><item><title>Improved Packing and Routing of Vehicles with Compartments</title><link>https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/improved-packing-and-routing-of-vehicles-with-compartments/</guid><description/></item><item><title>Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints</title><link>https://ac.tuwien.ac.at/publication/introducing-the-virtual-network-mapping-problem-with-delay-routing-and-location-constraints/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/introducing-the-virtual-network-mapping-problem-with-delay-routing-and-location-constraints/</guid><description/></item><item><title>On Stabilized Branch-and-Price for Constrained Tree Problems</title><link>https://ac.tuwien.ac.at/publication/on-stabilized-branch-and-price-for-constrained-tree-problems/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-stabilized-branch-and-price-for-constrained-tree-problems/</guid><description/></item><item><title>Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques</title><link>https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-mathematical-programming-techniques/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-mathematical-programming-techniques/</guid><description/></item><item><title>Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments</title><link>https://ac.tuwien.ac.at/publication/tackling-the-loading-aspect-of-the-vehicle-routing-problem-with-compartments/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/tackling-the-loading-aspect-of-the-vehicle-routing-problem-with-compartments/</guid><description/></item><item><title>Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/using-a-solution-archive-to-enhance-metaheuristics-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/using-a-solution-archive-to-enhance-metaheuristics-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</guid><description/></item><item><title>Variable Neighborhood Search for Capacitated Connected Facility Location</title><link>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-capacitated-connected-facility-location/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-capacitated-connected-facility-location/</guid><description/></item><item><title>A Brief Survey on Hybrid Metaheuristics</title><link>https://ac.tuwien.ac.at/publication/a-brief-survey-on-hybrid-metaheuristics/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-brief-survey-on-hybrid-metaheuristics/</guid><description/></item><item><title>A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-reconstructing-cross-cut-shredded-text-documents/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-reconstructing-cross-cut-shredded-text-documents/</guid><description/></item><item><title>A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-population-management-for-the-generalized-minimum-vertex-biconnected-network-problem/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-population-management-for-the-generalized-minimum-vertex-biconnected-network-problem/</guid><description/></item><item><title>Branch-and-Cut-and-Price for Capacitated Connected Facility Location</title><link>https://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/branch-and-cut-and-price-for-capacitated-connected-facility-location/</guid><description/></item><item><title>Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive</title><link>https://ac.tuwien.ac.at/publication/enhancing-genetic-algorithms-by-a-trie-based-complete-solution-archive/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/enhancing-genetic-algorithms-by-a-trie-based-complete-solution-archive/</guid><description/></item><item><title>Fitting Multi-Planet Transit Models to Photometric Time-Data Series by Evolution Strategies</title><link>https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-photometric-time-data-series-by-evolution-strategies/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-photometric-time-data-series-by-evolution-strategies/</guid><description/></item><item><title>Matheuristics for the Periodic Vehicle Routing Problem with Time Windows</title><link>https://ac.tuwien.ac.at/publication/matheuristics-for-the-periodic-vehicle-routing-problem-with-time-windows/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/matheuristics-for-the-periodic-vehicle-routing-problem-with-time-windows/</guid><description/></item><item><title>Metaheuristic Hybrids</title><link>https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/</guid><description/></item><item><title>Multilevel Variable Neighborhood Search for Periodic Routing Problems</title><link>https://ac.tuwien.ac.at/publication/multilevel-variable-neighborhood-search-for-periodic-routing-problems/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/multilevel-variable-neighborhood-search-for-periodic-routing-problems/</guid><description/></item><item><title>Similarity Searching in Sequences of Complex Events</title><link>https://ac.tuwien.ac.at/publication/similarity-searching-in-sequences-of-complex-events/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/similarity-searching-in-sequences-of-complex-events/</guid><description/></item><item><title>Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization</title><link>https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-ant-colony-optimization/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-minimum-label-spanning-tree-problem-by-ant-colony-optimization/</guid><description/></item><item><title>Strong Lower Bounds for a Survivable Network Design Problem</title><link>https://ac.tuwien.ac.at/publication/strong-lower-bounds-for-a-survivable-network-design-problem/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/strong-lower-bounds-for-a-survivable-network-design-problem/</guid><description/></item><item><title>The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/</guid><description/></item><item><title>The Multidimensional Knapsack Problem: Structure and Algorithms</title><link>https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/</guid><description/></item><item><title>Trend-Based Similarity Search in Time-Series Data</title><link>https://ac.tuwien.ac.at/publication/trend-based-similarity-search-in-time-series-data/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/trend-based-similarity-search-in-time-series-data/</guid><description/></item><item><title>Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-ant-colony-optimization-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-and-ant-colony-optimization-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</guid><description/></item><item><title>Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problem</title><link>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-coupled-with-ilp-based-large-neighborhood-searches-for-the-periodic-location-routing-problem/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-coupled-with-ilp-based-large-neighborhood-searches-for-the-periodic-location-routing-problem/</guid><description/></item><item><title>Accelerating Column Generation for a Survivable Network Design Problem</title><link>https://ac.tuwien.ac.at/publication/accelerating-column-generation-for-a-survivable-network-design-problem/</link><pubDate>Wed, 01 Apr 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/accelerating-column-generation-for-a-survivable-network-design-problem/</guid><description/></item><item><title>Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation</title><link>https://ac.tuwien.ac.at/publication/solving-a-multi-constrained-network-design-problem-by-lagrangean-decomposition-and-column-generation/</link><pubDate>Wed, 01 Apr 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-multi-constrained-network-design-problem-by-lagrangean-decomposition-and-column-generation/</guid><description/></item><item><title>(Meta-)Heuristic Separation of Jump Cuts in a Branch\&amp;Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem-2/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem-2/</guid><description/></item><item><title>A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows</title><link>https://ac.tuwien.ac.at/publication/a-column-generation-approach-for-the-periodic-vehicle-routing-problem-with-time-windows/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-column-generation-approach-for-the-periodic-vehicle-routing-problem-with-time-windows/</guid><description/></item><item><title>A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse</title><link>https://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-computing-tours-in-a-spare-parts-warehouse/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-computing-tours-in-a-spare-parts-warehouse/</guid><description/></item><item><title>A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem-2/</guid><description/></item><item><title>A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-kruskal-based-heuristic-for-the-rooted-delay-constrained-minimum-spanning-tree-problem/</guid><description/></item><item><title>A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location</title><link>https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-based-heuristic-for-capacitated-connected-facility-location/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-based-heuristic-for-capacitated-connected-facility-location/</guid><description/></item><item><title>A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-generalized-minimum-vertex-biconnected-network-problem/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-generalized-minimum-vertex-biconnected-network-problem/</guid><description/></item><item><title>Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques</title><link>https://ac.tuwien.ac.at/publication/boosting-a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows-by-ilp-techniques/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/boosting-a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows-by-ilp-techniques/</guid><description/></item><item><title>Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/cluster-based-meta-heuristics-for-the-euclidean-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location</title><link>https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhood-search-for-capacitated-connected-facility-location/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhood-search-for-capacitated-connected-facility-location/</guid><description/></item><item><title>Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location</title><link>https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhoood-search-for-capacitated-connected-facility-location/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhoood-search-for-capacitated-connected-facility-location/</guid><description/></item><item><title>Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouses</title><link>https://ac.tuwien.ac.at/publication/computing-optimized-stock-re-placements-in-last-in-first-out-warehouses/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/computing-optimized-stock-re-placements-in-last-in-first-out-warehouses/</guid><description/></item><item><title>Cooperative Hybrids for Combinatorial Optimization</title><link>https://ac.tuwien.ac.at/publication/cooperative-hybrids-for-combinatorial-optimization/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/cooperative-hybrids-for-combinatorial-optimization/</guid><description/></item><item><title>Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances</title><link>https://ac.tuwien.ac.at/publication/exploiting-hierarchical-clustering-for-finding-bounded-diameter-minimum-spanning-trees-on-euclidean-instances/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exploiting-hierarchical-clustering-for-finding-bounded-diameter-minimum-spanning-trees-on-euclidean-instances/</guid><description/></item><item><title>Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms</title><link>https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-corot-time-data-series-by-evolutionary-algorithms/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fitting-multi-planet-transit-models-to-corot-time-data-series-by-evolutionary-algorithms/</guid><description/></item><item><title>Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms</title><link>https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms-2/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms-2/</guid><description/></item><item><title>Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms</title><link>https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fitting-rectangular-signals-to-time-series-data-by-metaheuristic-algorithms/</guid><description/></item><item><title>Hybrid Metaheuristics</title><link>https://ac.tuwien.ac.at/publication/hybrid-metaheuristics/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hybrid-metaheuristics/</guid><description/></item><item><title>Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents</title><link>https://ac.tuwien.ac.at/publication/meta-heuristics-for-reconstructing-cross-cut-shredded-text-documents/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/meta-heuristics-for-reconstructing-cross-cut-shredded-text-documents/</guid><description/></item><item><title>MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics</title><link>https://ac.tuwien.ac.at/publication/metaboosting-enhancing-integer-programming-techniques-by-metaheuristics/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/metaboosting-enhancing-integer-programming-techniques-by-metaheuristics/</guid><description/></item><item><title>Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows</title><link>https://ac.tuwien.ac.at/publication/multiple-variable-neighborhood-search-enriched-with-ilp-techniques-for-the-periodic-vehicle-routing-problem-with-time-windows/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/multiple-variable-neighborhood-search-enriched-with-ilp-techniques-for-the-periodic-vehicle-routing-problem-with-time-windows/</guid><description/></item><item><title>Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/solving-a-video-server-load-re-balancing-problem-by-mixed-integer-programming-and-hybrid-variable-neighborhood-search/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-video-server-load-re-balancing-problem-by-mixed-integer-programming-and-hybrid-variable-neighborhood-search/</guid><description/></item><item><title>Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates</title><link>https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/</guid><description/></item><item><title>Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics</title><link>https://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-euclidean-bounded-diameter-minimum-spanning-tree-problem-by-clustering-based-meta-heuristics/</guid><description/></item><item><title>Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates</title><link>https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates/</link><pubDate>Mon, 01 Sep 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates/</guid><description/></item><item><title>(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-for-the-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-for-the-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>(Meta-)Heuristic Separation of Jump Cuts in a Branch\&amp;Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem-2/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem-2/</guid><description/></item><item><title>A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-lagrangian-relax-and-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-lagrangian-relax-and-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows</title><link>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-periodic-vehicle-routing-problem-with-time-windows/</guid><description/></item><item><title>An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem</title><link>https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem-2/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem-2/</guid><description/></item><item><title>Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/</guid><description/></item><item><title>Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization</title><link>https://ac.tuwien.ac.at/publication/combining-integer-linear-programming-techniques-and-metaheuristics-for-combinatorial-optimization/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-integer-linear-programming-techniques-and-metaheuristics-for-combinatorial-optimization/</guid><description/></item><item><title>Combining Forces to Reconstruct Strip Shredded Text Documents</title><link>https://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-forces-to-reconstruct-strip-shredded-text-documents/</guid><description/></item><item><title>Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/</guid><description/></item><item><title>Effective Neighborhood Structures for the Generalized Traveling Salesman Problem</title><link>https://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/</guid><description/></item><item><title>Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees</title><link>https://ac.tuwien.ac.at/publication/exact-methods-and-metaheuristic-approaches-for-deriving-high-quality-fully-resolved-consensus-trees/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exact-methods-and-metaheuristic-approaches-for-deriving-high-quality-fully-resolved-consensus-trees/</guid><description/></item><item><title>Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms</title><link>https://ac.tuwien.ac.at/publication/finding-consensus-trees-by-evolutionary-variable-neighborhood-search-and-hybrid-algorithms/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/finding-consensus-trees-by-evolutionary-variable-neighborhood-search-and-hybrid-algorithms/</guid><description/></item><item><title>Heuristic Cut Separation in a Branch\&amp;Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/heuristic-cut-separation-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/heuristic-cut-separation-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks</title><link>https://ac.tuwien.ac.at/publication/lagrangian-decomposition-metaheuristics-and-hybrid-approaches-for-the-design-of-the-last-mile-in-fiber-optic-networks/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/lagrangian-decomposition-metaheuristics-and-hybrid-approaches-for-the-design-of-the-last-mile-in-fiber-optic-networks/</guid><description/></item><item><title>Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization</title><link>https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-post-enrolment-course-timetabling-problem-by-ant-colony-optimization/</guid><description/></item><item><title>Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem</title><link>https://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/</guid><description/></item><item><title>Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem</title><link>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-a-prize-collecting-capacity-constrained-connected-facility-location-problem/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-a-prize-collecting-capacity-constrained-connected-facility-location-problem/</guid><description/></item><item><title>A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks</title><link>https://ac.tuwien.ac.at/publication/a-directed-cut-model-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-directed-cut-model-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/</guid><description/></item><item><title>A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem/</guid><description/></item><item><title>A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks</title><link>https://ac.tuwien.ac.at/publication/a-multi-commodity-flow-approach-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-multi-commodity-flow-approach-for-the-design-of-the-last-mile-in-real-world-fiber-optic-networks/</guid><description/></item><item><title>Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-an-evolutionary-algorithm-for-the-knapsack-constrained-maximum-spanning-tree-problem/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-an-evolutionary-algorithm-for-the-knapsack-constrained-maximum-spanning-tree-problem/</guid><description/></item><item><title>Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/compressing-fingerprint-templates-by-solving-an-extended-minimum-label-spanning-tree-problem/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/compressing-fingerprint-templates-by-solving-an-extended-minimum-label-spanning-tree-problem/</guid><description/></item><item><title>CyMATE: A New Tool for Methylation Analysis of Plant Genomic DNA after Bisulfite Sequencing</title><link>https://ac.tuwien.ac.at/publication/cymate-a-new-tool-for-methylation-analysis-of-plant-genomic-dna-after-bisulfite-sequencing/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/cymate-a-new-tool-for-methylation-analysis-of-plant-genomic-dna-after-bisulfite-sequencing/</guid><description/></item><item><title>Determining Orbital Elements of Extrasolar Planets by Evolution Strategies</title><link>https://ac.tuwien.ac.at/publication/determining-orbital-elements-of-extrasolar-planets-by-evolution-strategies/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/determining-orbital-elements-of-extrasolar-planets-by-evolution-strategies/</guid><description/></item><item><title>Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem</title><link>https://ac.tuwien.ac.at/publication/fingerprint-template-compression-by-solving-a-minimum-label-k-node-subtree-problem/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fingerprint-template-compression-by-solving-a-minimum-label-k-node-subtree-problem/</guid><description/></item><item><title>Models and Algorithms for Three-Stage Two-Dimensional Bin Packing</title><link>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing-2/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing-2/</guid><description/></item><item><title>The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/</guid><description/></item><item><title>The Multidimensional Knapsack Problem: Structure and Algorithms</title><link>https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/</guid><description/></item><item><title>Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem</title><link>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/</guid><description/></item><item><title>A Unified View on Hybrid Metaheuristics</title><link>https://ac.tuwien.ac.at/publication/a-unified-view-on-hybrid-metaheuristics/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-unified-view-on-hybrid-metaheuristics/</guid><description/></item><item><title>Biased Mutation Operators for Subgraph-Selection Problems</title><link>https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems-2/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems-2/</guid><description/></item><item><title>Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/</guid><description/></item><item><title>Cleaning of Raw Peptide MS/MS Spectra: Improved Protein Identification Following Deconvolution of Multiply Charged Peaks, Isotope Clusters, and Removal of Background Noise</title><link>https://ac.tuwien.ac.at/publication/cleaning-of-raw-peptide-ms-ms-spectra-improved-protein-identification-following-deconvolution-of-multiply-charged-peaks-isotope-clusters-and-removal-of-background-noise/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/cleaning-of-raw-peptide-ms-ms-spectra-improved-protein-identification-following-deconvolution-of-multiply-charged-peaks-isotope-clusters-and-removal-of-background-noise/</guid><description/></item><item><title>Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/</guid><description/></item><item><title>Evolutionary Approach to Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/evolutionary-approach-to-constrained-minimum-spanning-tree-problem/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/evolutionary-approach-to-constrained-minimum-spanning-tree-problem/</guid><description/></item><item><title>Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO</title><link>https://ac.tuwien.ac.at/publication/neighborhood-searches-for-the-bounded-diameter-minimum-spanning-tree-problem-embedded-in-a-vns-ea-and-aco/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/neighborhood-searches-for-the-bounded-diameter-minimum-spanning-tree-problem-embedded-in-a-vns-ea-and-aco/</guid><description/></item><item><title>The Core Concept for the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/the-core-concept-for-the-multidimensional-knapsack-problem/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-core-concept-for-the-multidimensional-knapsack-problem/</guid><description/></item><item><title>Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering</title><link>https://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/</guid><description/></item><item><title>A New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-new-0-1-ilp-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-new-0-1-ilp-approach-for-the-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem</title><link>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-solving-the-car-sequencing-problem/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-approach-for-solving-the-car-sequencing-problem/</guid><description/></item><item><title>An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem</title><link>https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem/</guid><description/></item><item><title>Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification</title><link>https://ac.tuwien.ac.at/publication/combining-metaheuristics-and-exact-algorithms-in-combinatorial-optimization-a-survey-and-classification/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-metaheuristics-and-exact-algorithms-in-combinatorial-optimization-a-survey-and-classification/</guid><description/></item><item><title>Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/</guid><description/></item><item><title>Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/cooperating-memetic-and-branch-and-cut-algorithms-for-solving-the-multidimensional-knapsack-problem/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/cooperating-memetic-and-branch-and-cut-algorithms-for-solving-the-multidimensional-knapsack-problem/</guid><description/></item><item><title>Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem-2/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem-2/</guid><description/></item><item><title>Relaxation Guided Variable Neighborhood Search</title><link>https://ac.tuwien.ac.at/publication/relaxation-guided-variable-neighborhood-search/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/relaxation-guided-variable-neighborhood-search/</guid><description/></item><item><title>Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-column-generation-in-integer-programming-an-effective-approach-for-2d-bin-packing/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-column-generation-in-integer-programming-an-effective-approach-for-2d-bin-packing/</guid><description/></item><item><title>An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-maximum-weight-trace-formulation-of-the-multiple-sequence-alignment-problem/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-maximum-weight-trace-formulation-of-the-multiple-sequence-alignment-problem/</guid><description/></item><item><title>An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem</title><link>https://ac.tuwien.ac.at/publication/an-improved-hybrid-genetic-algorithm-for-the-generalized-assignment-problem/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-improved-hybrid-genetic-algorithm-for-the-generalized-assignment-problem/</guid><description/></item><item><title>Biased Mutation Operators for Subgraph-Selection Problems</title><link>https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems/</guid><description/></item><item><title>Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem</title><link>https://ac.tuwien.ac.at/publication/combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-problem/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-problem/</guid><description/></item><item><title>Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/empirical-analysis-of-locality-heritability-and-heuristic-bias-in-evolutionary-algorithms-a-case-study-for-the-multidimensional-knapsack-problem/</guid><description/></item><item><title>Models and Algorithms for Three-Stage Two-Dimensional Bin Packing</title><link>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/models-and-algorithms-for-three-stage-two-dimensional-bin-packing/</guid><description/></item><item><title>Solving a Real-World Glass Cutting Problem</title><link>https://ac.tuwien.ac.at/publication/solving-a-real-world-glass-cutting-problem/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-real-world-glass-cutting-problem/</guid><description/></item><item><title>Hybrid Evolutionary Algorithms for Combinatorial Optimization</title><link>https://ac.tuwien.ac.at/publication/hybrid-evolutionary-algorithms-for-combinatorial-optimization/</link><pubDate>Sat, 01 Mar 2003 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hybrid-evolutionary-algorithms-for-combinatorial-optimization/</guid><description/></item><item><title>A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs/</guid><description/></item><item><title>A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-permutation-coded-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-permutation-coded-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>Edge-Sets: An Effective Evolutionary Coding of Spanning Trees</title><link>https://ac.tuwien.ac.at/publication/edge-sets-an-effective-evolutionary-coding-of-spanning-trees/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/edge-sets-an-effective-evolutionary-coding-of-spanning-trees/</guid><description/></item><item><title>Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/greedy-heuristics-and-an-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/greedy-heuristics-and-an-evolutionary-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/</guid><description/></item><item><title>A Memetic Algorithm for Vertex-Biconnectivity Augmentation</title><link>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-vertex-biconnectivity-augmentation/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-vertex-biconnectivity-augmentation/</guid><description/></item><item><title>Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem</title><link>https://ac.tuwien.ac.at/publication/evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem/</guid><description/></item><item><title>Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges</title><link>https://ac.tuwien.ac.at/publication/initialization-is-robust-in-evolutionary-algorithms-that-encode-spanning-trees-as-sets-of-edges/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/initialization-is-robust-in-evolutionary-algorithms-that-encode-spanning-trees-as-sets-of-edges/</guid><description/></item><item><title>Letting Ants Labeling Point Features</title><link>https://ac.tuwien.ac.at/publication/letting-ants-labeling-point-features/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/letting-ants-labeling-point-features/</guid><description/></item><item><title>On Weight-Biased Mutation for Graph Problems</title><link>https://ac.tuwien.ac.at/publication/on-weight-biased-mutation-for-graph-problems/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-weight-biased-mutation-for-graph-problems/</guid><description/></item><item><title>An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem/</link><pubDate>Mon, 01 Jan 2001 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem/</guid><description/></item><item><title>Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search</title><link>https://ac.tuwien.ac.at/publication/prufer-numbers-a-poor-representation-of-spanning-trees-for-evolutionary-search/</link><pubDate>Mon, 01 Jan 2001 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/prufer-numbers-a-poor-representation-of-spanning-trees-for-evolutionary-search/</guid><description/></item><item><title>Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems</title><link>https://ac.tuwien.ac.at/publication/weight-biased-edge-crossover-in-evolutionary-algorithms-for-two-graph-problems/</link><pubDate>Mon, 01 Jan 2001 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/weight-biased-edge-crossover-in-evolutionary-algorithms-for-two-graph-problems/</guid><description/></item><item><title>A Hybrid GA for the Edge-Biconnectivity Augmentation Problem</title><link>https://ac.tuwien.ac.at/publication/a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem/</guid><description/></item><item><title>A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-predecessor-coding-in-an-evolutionary-algorithm-for-the-capacitated-minimum-spanning-tree-problem/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-predecessor-coding-in-an-evolutionary-algorithm-for-the-capacitated-minimum-spanning-tree-problem/</guid><description/></item><item><title>A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-weighted-coding-in-a-genetic-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-weighted-coding-in-a-genetic-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/</guid><description/></item><item><title>An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/an-efficient-evolutionary-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-efficient-evolutionary-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/</guid><description/></item><item><title>The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search</title><link>https://ac.tuwien.ac.at/publication/the-effects-of-locality-on-the-dynamics-of-decoder-based-evolutionary-search/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-effects-of-locality-on-the-dynamics-of-decoder-based-evolutionary-search/</guid><description/></item><item><title>A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem</title><link>https://ac.tuwien.ac.at/publication/a-weight-coded-genetic-algorithm-for-the-multiple-container-packing-problem/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-weight-coded-genetic-algorithm-for-the-multiple-container-packing-problem/</guid><description/></item><item><title>An Evolutionary Approach to Point-Feature Label Placement</title><link>https://ac.tuwien.ac.at/publication/an-evolutionary-approach-to-point-feature-label-placement/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-evolutionary-approach-to-point-feature-label-placement/</guid><description/></item><item><title>Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/characterizing-locality-in-decoder-based-eas-for-the-multidimensional-knapsack-problem/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/characterizing-locality-in-decoder-based-eas-for-the-multidimensional-knapsack-problem/</guid><description/></item><item><title>On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms</title><link>https://ac.tuwien.ac.at/publication/on-the-importance-of-phenotypic-duplicate-elimination-in-decoder-based-evolutionary-algorithms/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-importance-of-phenotypic-duplicate-elimination-in-decoder-based-evolutionary-algorithms/</guid><description/></item><item><title>The Multiple Container Packing Problem: A Genetic Algorithm Approach with Weighted Codings</title><link>https://ac.tuwien.ac.at/publication/the-multiple-container-packing-problem-a-genetic-algorithm-approach-with-weighted-codings/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-multiple-container-packing-problem-a-genetic-algorithm-approach-with-weighted-codings/</guid><description/></item><item><title>Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/weight-codings-in-a-genetic-algorithm-for-the-multiconstraint-knapsack-problem/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/weight-codings-in-a-genetic-algorithm-for-the-multiconstraint-knapsack-problem/</guid><description/></item><item><title>A Genetic Algorithm for Labeling Point Features</title><link>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-labeling-point-features/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-labeling-point-features/</guid><description/></item><item><title>A Hybrid GP Approach for Numerically Robust Symbolic Regression</title><link>https://ac.tuwien.ac.at/publication/a-hybrid-gp-approach-for-numerically-robust-symbolic-regression/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-hybrid-gp-approach-for-numerically-robust-symbolic-regression/</guid><description/></item><item><title>An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem</title><link>https://ac.tuwien.ac.at/publication/an-improved-genetic-algorithm-for-the-multiconstrained-0-1-knapsack-problem/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-improved-genetic-algorithm-for-the-multiconstrained-0-1-knapsack-problem/</guid><description/></item><item><title>Approximation with Evolutionary Optimized Tensor Product Bernstein Polynomials</title><link>https://ac.tuwien.ac.at/publication/approximation-with-evolutionary-optimized-tensor-product-bernstein-polynomials/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/approximation-with-evolutionary-optimized-tensor-product-bernstein-polynomials/</guid><description/></item><item><title>Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks</title><link>https://ac.tuwien.ac.at/publication/evolutionary-optimized-tensor-product-bernstein-polynomials-versus-backpropagation-networks/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/evolutionary-optimized-tensor-product-bernstein-polynomials-versus-backpropagation-networks/</guid><description/></item><item><title>Genetic Algorithms for the Multiple Container Packing Problem</title><link>https://ac.tuwien.ac.at/publication/genetic-algorithms-for-the-multiple-container-packing-problem/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/genetic-algorithms-for-the-multiple-container-packing-problem/</guid><description/></item><item><title>Transforming an Analytically Defined Color Space to Match Psychophysically Gained Color Distances</title><link>https://ac.tuwien.ac.at/publication/transforming-an-analytically-defined-color-space-to-match-psychophysically-gained-color-distances/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/transforming-an-analytically-defined-color-space-to-match-psychophysically-gained-color-distances/</guid><description/></item><item><title>Progressives, adaptives Ray-Tracing von Bildern mit hoher zeitlicher Kohärenz</title><link>https://ac.tuwien.ac.at/publication/progressives-adaptives-ray-tracing-von-bildern-mit-hoher-zeitlicher-koharenz/</link><pubDate>Sat, 01 Jan 1994 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/progressives-adaptives-ray-tracing-von-bildern-mit-hoher-zeitlicher-koharenz/</guid><description/></item><item><title>Parallel Beam Search for Combinatorial Optimization</title><link>https://ac.tuwien.ac.at/publication/parallel-beam-search-for-combinatorial-optimization-2/</link><pubDate>Thu, 01 Jan 1970 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parallel-beam-search-for-combinatorial-optimization-2/</guid><description/></item></channel></rss>