Günther Raidl
» Ao.Univ.Prof. Dipl.-Ing. Dr.techn.
contact | research | organizational activities | publications
Contact Information
Address:
Günther Raidl
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria
| Room: | HC0407 |
| Phone: | +43(1)58801–192116 |
| Fax: | +43(1)58801–9192116 |
| Email: | raidl@ac.tuwien.ac.at |
| Web: | http://www.ac.tuwien.ac.at/people/raidl/ |
| Office Hours: | by appointment |
| ORCID: | https://orcid.org/0000-0002-3293-177X |
Research Interests
- Solving algorithmic problems arising in various application domains, e.g. network design and other problems on graphs, transportation optimization, cutting and packing, computational biology, scheduling and timetabling
- Combinatorial optimization by means of exact techniques including mathematical programming, branch and bound, dynamic programming, constraint programming as well as heuristics and metaheuristics
- Machine learning, reinforcement learning
- A particular focus lies in hybrid optimization techniques combining concepts of (meta-)heuristics, exact optimization techniques, and machine learning.
- Efficient algorithms and data structures in general.
Also see the group's research page.
International Organizational Activities
Board Memberships etc.:
- Faculty member of the Vienna Graduate School on Computational Optimization (VGSCO), since 2017.
- Editorial board member of the Algorithms journal , MDPI, since 2020.
- Editorial board member of the journal Engineering Applications of Artificial Intelligence, Elsevier, since 2022.
- Associate editor for ACM Transactions on Evolutionary Learning and Optimization, since 2019.
- Associate editor of the INFORMS Journal on Computing, since 2013.
- Editorial board member of the Metaheuristics journal, Springer, since 2018.
- Associate editor of the Evolutionary Computation Journal, MIT Press, 2005-2014, editorial board member since 2015.
- Associate editor of the International Journal of Metaheuristics, Inderscience, since 2007.
- Editorial board member of the journal Journal of Artificial Evolution and Applications, Hindawi Publishing, 2007-2010.
- Editorial board member of the journal Memetic Computing, Springer, since 2007.
- Editorial board member of the International Journal of Applied Metaheuristic Computing, IGI Global, since 2010
- Co-founder and member of the steering committee of the Conference Series on Evolutionary Computation in Combinatorial Optimization, EvoCOP.
- Steering committee member of EvoAPPS, the Int. Conference Series on Applications of Evolutionary Computation, since 2018.
- We have participated in the European Marie Curie Research Training Network on Algorithmic and Discrete Optimization (ADONET) and I was TU Wien's local coordinator.
- Executive Board member of ÖGOR, the Austrian Society of Operations Research, 2013-2016.
- Management Board member of EU COST Action CA15140 Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice (ImAppNIO) since January 2016
Some (more or less) recent major activities:
- Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 19th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, February 2024.
- Local chair of SoCS 2022: The International Symposium on Combinatorial Search, Vienna, Austria, July 2022.
- Program Chair of the 10th Metaheuristic International Conference (MIC) 2013, Singapore, August 2013.
- Local Co-Organizer of EvoStar 2013, The Leading European Event on Bioinspired Computation, Vienna, Austria, April 2013.
- General and Local Chair of the Hybrid Metaheuristics Workshop, Vienna, Austria, October 1-2, 2010.
- Co-Chair of the Evolutionary & Metaheuristic Combinatorial Optimization Track of the 2011 Genetic and Evolutionary Computation Conference (GECCO), Dublin, Ireland, July 2011.
- Editor-in-Chief and Program Chair of GECCO 2009, the 11th Annual Genetic and Evolutionary Computation Conference 2009, ACM, Montreal, Canada, July 2009.
- IEEE Computational Intelligence Society Emergent Technology Technical Committee Member (IEEE CIS ETTC), 2012.
- EvoStar "Old Croc" Award for Outstanding Contributions to Evolutionary Computation in Europe, April 2012
Finally, find here a detailed list of most of my past and present international organisational activities.
Publications
Alternative PDF list of publications
314 results
| [314] | Parallel Beam Search for Combinatorial Optimization Workshop Proceedings of the International Conference on Parallel Processing (ICPP 2022), pages 1–8, ACM Press. |
| 2024 | |
| [313] | Signed double Roman domination on cubic graphs Applied Mathematics and Computation, volume 471, pages 128612, 2024, Elsevier. |
| [312] | Tackling the $\alpha$-Domination Problem Heuristically 19th International Conference on Computer Aided Systems Theory, 2024, Springer. Note: to appear; preprint: https://www.ac.tuwien.ac.at/files/pub/iurlano-varga-raidl-24.pdf |
| [311] | A Simulated Annealing Based Approach for the Roman Domination Problem Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), pages 28–43, 2024, Springer Nature Switzerland. Note: preprint: https://www.ac.tuwien.ac.at/files/pub/greilhuber-schober-iurlano-raidl-23.pdf |
| 2023 | |
| [310] | Scheduling Jobs Using Queries to Interactively Learn Human Availability Times Computers and Operations Research, 2023. Note: to appear |
| [309] | Large Neighborhood Search for Electric Vehicle Fleet Scheduling Energies, volume 16, number 12, 2023. |
| [308] | Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks Machine Learning, Optimization, and Data Science. LOD 2023., 2023, Springer. Note: to appear |
| [307] | Interactive Job Scheduling with Partially Known Personnel Availabilities OLA 2023: Optimization and Learning (B. Dorronsoro, F. Chicano, G. Danoy, E.-G. Talbi, eds.), volume 1824 of Communications in Computer and Information Science, pages 236–247, 2023, Springer. |
| [306] | An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles EvoApplications 2023: Applications of Evolutionary Computation (J. Correia, S. Smith, R. Qaddoura, eds.), volume 13989 of LNCS, pages 3-18, 2023, Springer. |
| [305] | Optimizing the positions of battery swapping stations – Pilot Studies and Layout Optimization Algorithm Proceedings to the 6th International Electric Vehicle Technology Conference, pages 20231015, 2023, JSAE. |
| [304] | A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), volume 13987 of LNCS, pages 50–65, 2023, Springer. |
| [303] | A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem Computer Aided Systems Theory – EUROCAST 2022 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 13789 of LNCS, pages 87-95, 2023, Springer. |
| [302] | Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines , pages 1941–1949, 2023, ACM Press. |
| [301] | A Policy-Based Learning Beam Search for Combinatorial Optimization Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), volume 13987 of LNCS, pages 130–145, 2023, Springer. Note: best paper award winner |
| 2022 | |
| [300] | Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet Access, volume 10, 2022. |
| [299] | Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences Applied Soft Computing, volume 122, pages 108844, 2022. |
| [298] | A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (Alexis Quesada-Arencibia, others, eds.), pages 32–33, feb 2022. |
| [297] | A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters Chapter in Computer Aided Systems Theory – EUROCAST 2022, volume 13789 of LNCS, pages 121-129, 2022, Springer. |
| [296] | A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 22–23, 2022. |
| [295] | Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 20–21, 2022. |
| [294] | A Learning Large Neighborhood Search for the Staff Rerostering Problem Integration of Constraint Programming, Artificial Intelligence, and Operations Research – CPAIOR 2022 (Pierre Schaus, ed.), volume 13292 of LNCS, pages 300–317, 2022, Springer. |
| [293] | A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Leslie Pérez Cáceres, Sébastien Verel, eds.), volume 13222 of LNCS, pages 127–142, 2022, Springer. Note: best paper award winner |
| [292] | A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Farouk Yalaoui, El-Ghazali Talbi, Grégoire Danoy, eds.), volume 1541 of CCIS, pages 3–17, 2022, Springer. |
| [291] | Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems Machine Learning, Optimization, and Data Science, LOD 2021 (Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Gabriele La Malfa, Giorgio Jansen, Panos M. Pardalos, Giovanni Giuffrida, Renato Umeton, eds.), volume 13164 of LNCS, pages 283–298, 2022, Springer. |
| [290] | Parallel Beam Search for Combinatorial Optimization Fifteenth International Symposium on Combinatorial Search (SoCS 2022), pages 273–275, 2022, AAAI. |
| 2021 | |
| [289] | Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings Mathematics, volume 9, number 13, 2021. |
| [288] | Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Annals of Operations Research, volume 302, pages 407–531, 2021. |
| [287] | Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers Energies, volume 14, number 22, 2021. |
| [286] | A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Algorithms, volume 14, number 8, pages 232, 2021. |
| [285] | A*-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem Computers & Operations Research, volume 126, number 105125, 2021. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf |
| [284] | A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Annals of Operations Research, volume 302, pages 477–501, 2021. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf |
| [283] | Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 72–88, 2021, Springer. |
| [282] | Driver Shift Planning for an Online Store with Short Delivery Times Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 517–524, 2021. |
| [281] | Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 366-370, 2021. |
| [280] | Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 283–298, 2021, Springer. |
| 2020 | |
| [279] | An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem International Transactions in Operational Research, jan 2020. |
| [278] | A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three Applied Mathematics and Computation, volume 380, number 125233, 2020. |
| [277] | A Model for Finding Transition-Minors Discrete Applied Mathematics, volume 228, pages 242–264, 2020. |
| [276] | Finding Longest Common Subsequences: New anytime A$^*$ Search Results Applied Soft Computing, volume 95, number 106400, 2020. |
| [275] | An A* Search Algorithm for the Constrained Longest Common Subsequence Problem Information Processing Letters, volume 166, number 106041, 2020. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf |
| [274] | Anytime Algorithms for the Longest Common Palindromic Subsequence Problem Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier. |
| [273] | Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem Computers & Operations Research, volume 125, number 105089, 2020. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf |
| [272] | A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem Proceedings of PPSN XVI: Parallel Problem Solving from Nature (Thomas Bäck, Mike Preuss, André Deutz, Hao Wang, Carola Doerr, Michael Emmerich, Heike Trautmann, eds.), volume 12270 of LNCS, pages 385–398, 2020, Springer. |
| [271] | Distributing Battery Swapping Stations for Electric Scooters in an Urban Area Optimization and Applications, Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 150–165, 2020, Springer. |
| [270] | Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 738–750, 2020, Springer. |
| [269] | VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points Computer Aided Systems Theory – EUROCAST 2019, volume 12013 of LNCS, pages 255–262, 2020, Springer. |
| [268] | On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 134–149, 2020, Springer. |
| [267] | Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 344–351, 2020, Springer. |
| [266] | A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2020: Volume I (Patrick De Causmaecker, Ender Özcan, Greet Vanden Berghe, eds.), 2020. |
| [265] | A Beam Search Approach to the Traveling Tournament Problem Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020 (Luís Paquete, Christine Zarges, eds.), volume 12102 of LNCS, pages 67–82, 2020, Springer. |
| [264] | Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 445–457, 2020, Springer. |
| [263] | Casual Employee Scheduling with Constraint Programming and Metaheuristics Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 279–287, 2020, Springer. |
| [262] | On Solving a Generalized Constrained Longest Common Subsequence Problem Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 55–79, 2020, Springer. |
| [261] | A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation Proceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science (Giuseppe Nicosia, Panos Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 154–167, 2020, Springer. |
| [260] | A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources 09 2020, Presentation, CPAIOR2020. |
| 2019 | |
| [259] | Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm Artificial Intelligence, volume 277, number 103173, 2019. |
| [258] | VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 70–71, feb 2019. |
| [257] | Metaheuristic Hybrids Chapter in Handbook of Metaheuristics (Michel Gendreau, Jean Yves Potvin, eds.), pages 385–417, 2019, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf |
| [256] | Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 94–95, 2019. |
| [255] | Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 78–79, 2019. |
| [254] | A Memetic Algorithm for Competitive Facility Location Problems Chapter in Business and Consumer Analytics: New Ideas, pages 637–660, 2019, Springer. |
| [253] | Strategies for Iteratively Refining Layered Graph Models Hybrid Metaheuristics: 11th International Workshop, HM 2019 (M. J. Blesa Aguilera, C. Blum, H. Gambini Santos, P. Pinacho-Davidson, J. Godoy del Campo, eds.), volume 11299 of LNCS, pages 46–62, 2019, Springer. |
| [252] | A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 184–200, 2019, Springer. |
| [251] | A SAT Approach for Finding Sup-Transition-Minors Learning and Intelligent Optimization. LION 2019, volume 11968 of LNCS, pages 325–341, 2019, Springer. |
| [250] | A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Evolutionary Computation in Combinatorial Optimization (Arnaud Liefooghe, Luís Paquete, eds.), volume 11452 of LNCS, pages 1–16, 2019, Springer. |
| [249] | A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem Proceedings of AI 2019: Advances in Artificial Intelligence (Jixue Liu, James Bailey, eds.), volume 11919 of LNCS, pages 549–560, 2019, Springer. |
| [248] | Towards Improving Merging Heuristics for Binary Decision Diagrams Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 30–45, 2019, Springer. |
| [247] | A Heuristic Approach for Solving the Longest Common Square Subsequence Problem Proceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 429-437, 2019, Springer. |
| [246] | A Heuristic Approach for Solving the Longest Common Square Subsequence Problem Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019), 2019. Note: accepted for presentation |
| [245] | Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem Proceedings of LION 12 – the 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199–214, 2019, Springer. |
| 2018 | |
| [244] | Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition Computers & Operations Research, volume 96, pages 30–54, 2018. |
| [243] | Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments International Transactions in Operational Research, 2018. |
| [242] | A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands Transportation Science, volume 52, number 3, pages 673–690, 2018. Note: previous technical report available at https://www.ac.tuwien.ac.at/files/tr/ac-tr-16-001.pdf |
| [241] | Semi-Automated Location Planning for Urban Bike-Sharing Systems Proceedings of the 7th Transport Research Arena (TRA 2018), pages 1–10, 2018. |
| [240] | Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments Computer Aided Systems Theory – EUROCAST 2017, Part I, pages 364–372, 2018, Springer. |
| [239] | Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 375–397, 2018. |
| [238] | Finding Smooth Graphs with Small Independence Numbers MOD 2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 527-539, 2018, Springer. |
| [237] | Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 355-363, 2018, Springer. |
| [236] | An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 235–256, 2018. |
| [235] | GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 299-306, 2018, Springer. |
| 2017 | |
| [234] | Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm Carpathian Journal of Mathematics, volume 33, number 3, pages 365–371, 2017. |
| [233] | Large Neighborhood Search for the Most Strings with Few Bad Columns Problem Soft Computing, volume 21, number 17, pages 4901–4915, 2017. |
| [232] | Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition Networks, volume 69, number 3, pages 270–289, 2017. Note: previous technical report available at https://www.ac.tuwien.ac.at/files/pub/kloimuellner-17a.pdf |
| [231] | A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015 (Karl Franz Dörner, Ivana Ljubić, Georg Pflug, Gernot Tragler, eds.), pages 393–399, 2017, Springer. |
| [230] | Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 106–107, 2017. |
| [229] | An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem Proceedings of the 12th Metaheuristics International Conference, pages 465–474, 2017. |
| [228] | Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem Conference Proceedings of Learning and Intelligent Optimization Conference (LION 11) (Roberto Battiti, Dmitri Kvasov, Yaroslav Sergeyev, eds.), volume 10556 of LNCS, pages 1–16, 2017, Springer. |
| [227] | Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 104–105, 2017. |
| [226] | Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control Evolutionary Computation in Combinatorial Optimization. EvoCOP 2017 (Bin Hu, Manuel López-Ibáñez, eds.), volume 10197 of LNCS, pages 91–107, 2017, Springer. |
| [225] | Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment MOD 2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 506–518, 2017, Springer. |
| [224] | GRASP and VNS for a Periodic VRP with Time Windows to Deal with Milk Collection Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory – EUROCAST 2017 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 2017. |
| [223] | A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015 (Karl Franz Dörner, Ivana Ljubić, Georg Pflug, Gernot Tragler, eds.), pages 385–391, 2017, Springer. |
| 2016 | |
| [222] | Hybrid Metaheuristics – Powerful Tools for Optimization 2016, Springer. |
| [221] | A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design Electronic Notes in Discrete Mathematics, volume 52, pages 189–196, 2016. Note: INOC 2015 – 7th International Network Optimization Conference |
| [220] | New Developments in Metaheuristics and their Applications – Selected Extended Contributions from the 10th Metaheuristics International Conference (MIC 2013) Journal of Heuristics, volume 22, number 4, pages 359–363, 2016. |
| [219] | A Memetic Algorithm for the Virtual Network Mapping Problem Journal of Heuristics, volume 22, number 4, pages 475–505, 2016. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/infuehr-14.pdf |
| [218] | Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem Optimization Letters, volume 10, number 1, pages 189–205, 2016. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/blum-15.pdf |
| [217] | An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands Electronic Notes in Discrete Mathematics, volume 52, pages 245–252, 2016. Note: INOC 2015 – 7th International Network Optimization Conference |
| [216] | Models and Algorithms for Competitive Facility Location Problems with Different Customer Behavior Annals of Mathematics and Artificial Intelligence, volume 76, number 1, pages 93–119, 2016, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/biesinger-14b.pdf |
| [215] | Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics Proceedings of Matheuristics 2016: 6th International Workshop on Model-Based Metaheuristics (T. Stützle, V. Maniezzo, eds.), pages 104–107, 2016. |
| [214] | Districting and Routing for Security Control Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 87–103, 2016, Springer. |
| [213] | Particle Therapy Patient Scheduling: First Heuristic Approaches PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling, pages 223–244, 2016. |
| [212] | Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 1–16, 2016, Springer. |
| 2015 | |
| [211] | Numerische Optimierung elektrifizierter Antriebsstränge Motortechnische Zeitschrift (MTZ), volume 03, pages 66–74, Mar 2015, Springer. |
| [210] | Numerical Optimisation of Electro-Hybrid Powertrains MTZ Worldwide, volume 03, pages 46–52, Mar 2015, Springer. |
| [209] | PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems Journal of Global Optimization, volume 63, number 3, pages 597-629, 2015, Springer. |
| [208] | Decomposition Based Hybrid Metaheuristics European Journal of Operational Research, volume 244, pages 66-76, 2015. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-15.pdf |
| [207] | Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem Central European Journal of Operations Research, volume 23, number 1, pages 89-113, 2015. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/hiermann-13.pdf |
| [206] | A Hybrid Genetic Algorithm with Solution Archive for the Discrete (r|p)-Centroid Problem Journal of Heuristics, volume 21, number 3, pages 391-431, 2015, Springer US. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/biesinger-14.pdf |
| [205] | Heuristic Approaches for the Probabilistic Traveling Salesman Problem Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia, others, eds.), pages 99 – 100, 2015. |
| [204] | A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia, others, eds.), pages 119–120, 2015. |
| [203] | Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem Conference Proceedings of Learning and Intelligent Optimization Conference (LION 9), volume 8994 of LNCS, pages 186-201, 2015, Springer. |
| [202] | On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 279-285, 2015, Springer. |
| [201] | CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 401–408, 2015, Springer. |
| [200] | On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics Proceedings of the 2015 International Symposium on Innovations in Intelligent Systems and Applications (INISTA) (David Camacho, others, eds.), pages 1-8, 2015, IEEE Xplore. |
| [199] | A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 125–126, 2015. |
| [198] | A New Solution Representation for the Firefighter Problem Evolutionary Computation in Combinatorial Optimization – EvoCOP 2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 25–35, 2015, Springer. |
| [197] | A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 109–110, 2015. |
| [196] | A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 384–392, 2015, Springer. |
| [195] | Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search The 3rd International Conference on Variable Neighborhood Search (VNS'14), volume 47 of Electronic Notes in Discrete Mathematics, pages 133–140, 2015, Elsevier. |
| [194] | Heuristic Approaches for the Probabilistic Traveling Salesman Problem Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 9520 of LNCS, pages 342–349, 2015, Springer International Publishing Switzerland. |
| [193] | A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problem Proceedings of the 11th Metaheuristics International Conference, pages 89/1–89/9, 2015. |
| [192] | A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands Evolutionary Computation in Combinatorial Optimization – EvoCOP 2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 48–60, 2015, Springer. |
| [191] | A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, others, eds.), volume 9520 of LNCS, pages 425–432, 2015, Springer International Publishing Switzerland. |
| 2014 | |
| [190] | Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles Chapter in Applications of Evolutionary Computation (Anna I. Esparcia-Alcázar, Antonio M. Mora, eds.), pages 553-564, 2014, Springer. |
| [189] | Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 149–156, 2014, Elsevier. |
| [188] | Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 183–197, 2014, Springer. |
| [187] | Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid Parallel Problem Solving from Nature – PPSN XIII (Thomas Bartz-Beielstein, Jürgen Branke, Bogdan Filipic, Jim Smith, eds.), volume 8672 of LNCS, pages 792–801, 2014, Springer. |
| [186] | Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case Evolutionary Computation in Combinatorial Optimization – EvoCOP 2014 (Christian Blum, Gabriela Ochoa, eds.), volume 8600 of LNCS, pages 73–84, 2014, Springer. |
| [185] | Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 141–148, 2014, Elsevier. |
| [184] | A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA 2014 (S. Lakusic, others, eds.), pages 691–696, 2014, Department of Transportation, University of Zagreb. |
| [183] | A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 85–99, 2014, Springer. |
| [182] | An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior Conference Proceedings of Learning and Intelligent Optimization Conference (LION 8), volume 8426 of LNCS, pages 203–217, 2014, Springer. |
| 2013 | |
| [181] | Stabilizing Branch-and-Price for Constrained Tree Problems Networks, volume 61, number 2, pages 150–170, 2013. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/leitner-11e.pdf |
| [180] | A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables Chapter in Advances in Metaheuristics (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), volume 53 of Operations Research/Computer Science Interfaces Series, pages 143–158, 2013, Springer. |
| [179] | An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure Proceedings of the 5th International Seminar on Railway Operations Modelling and Analysis – RailCopenhagen 2013, pages 765–774, 2013, IAROR. |
| [178] | Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP 2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 121-132, 2013, Springer. |
| [177] | Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 130–143, 2013, Springer. |
| [176] | A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 219–226, 2013, Springer. |
| [175] | A Memetic Algorithm for the Partition Graph Coloring Problem Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 167–169, 2013. |
| [174] | A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 372–379, 2013, Springer. |
| [173] | A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 223–225, 2013. |
| [172] | Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 30/1–30/10, 2013. |
| [171] | A Memetic Algorithm for the Virtual Network Mapping Problem Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 28/1–28/10, 2013. |
| [170] | GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 159–173, 2013, Springer. |
| [169] | Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP 2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 250-261, 2013, Springer. |
| [168] | Using Optimized Virtual Network Embedding for Network Dimensioning Proceedings of Networked Systems 2013, pages 118–125, 2013, IEEE. |
| [167] | A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 200–202, 2013. |
| [166] | Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 380–387, 2013, Springer. |
| [165] | Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 226–228, 2013. |
| [164] | PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems 2013, Technical report TR 186–1–13–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2012 | |
| [163] | Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Annals of Operations Research, volume 194, number 1, pages 325–339, 2012. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/nothegger-12.pdf |
| [162] | A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2012 (J.-K. Hao, M. Middendorf, eds.), volume 7245 of LNCS, pages 13–24, 2012, Springer, Heidelberg. |
| [161] | Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design Parallel Problem Solving from Nature–PPSN XII (C. A. Coello Coello, others, eds.), volume 7492 of LNCS, pages 458–467, 2012, Springer. |
| [160] | On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem Proceedings of the 2nd International Symposium on Combinatorial Optimization (A.R. Mahjoub, others, eds.), volume 7422 of LNCS, pages 225–236, 2012, Springer. |
| [159] | A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 351–358, 2012, Springer. |
| [158] | Hybrid Heuristics for Multimodal Homecare Scheduling 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) (Nicolas Beldiceanu, Narendra Jussien, Éric Pinson, eds.), pages 339–355, 2012, Springer. |
| [157] | Improved Packing and Routing of Vehicles with Compartments Computer Aided Systems Theory – EUROCAST 2011: 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6–11, 2011, Revised Selected Papers, Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 392–399, 2012, Springer. |
| [156] | Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 295–302, 2012, Springer. |
| [155] | Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles Applications of Evolutionary Computation – EvoApplications 2012 (C. Di Chio, others, eds.), volume 7248 of LNCS, pages 376–385, 2012, Springer, Heidelberg. |
| [154] | Automatic Generation of 2-AntWars Players with Genetic Programming Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 248–255, 2012, Springer. |
| [153] | An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 287–294, 2012, Springer. |
| [152] | An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO), pages 393–400, 2012, ACM Press. |
| [151] | A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 256–263, 2012, Springer. |
| 2011 | |
| [150] | Branch-and-Cut-and-Price for Capacitated Connected Facility Location Journal of Mathematical Modelling and Algorithms, volume 10, number 3, pages 245–267, 2011, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/leitner-10b.pdf |
| [149] | Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques Advances in Operations Research, volume 2011, number 143732, pages 1–38, 2011. |
| [148] | Hybrid Metaheuristics in Combinatorial Optimization: A Survey Applied Soft Computing, volume 11, pages 4135–4151, 2011. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/blum-11.pdf |
| [147] | Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem Network Optimization: 5th International Conference, INOC 2011 (J. Pahl, T. Reiners, S. Voß, eds.), volume 6701 of LNCS, pages 124–138, Jun 2011, Springer. |
| [146] | Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem Proceedings of the VII ALIO/EURO – Workshop on Applied Combinatorial Optimization, pages 250–253, May 2011. |
| [145] | A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV) (O. Günlük, G.J. Woeginger, eds.), volume 6655 of LNCS, pages 376–388, 2011, Springer, Heidelberg. |
| [144] | Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 285–287, 2011. |
| [143] | Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments Proceedings of the 9th Metaheuristics International Conference (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 679–681, 2011. |
| [142] | Improved Packing and Routing of Vehicles with Compartments Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 302–304, 2011. |
| [141] | A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables Proceedings of the 9th Metaheuristics International Conference (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 349–358, 2011. |
| [140] | Variable Neighborhood Search for Capacitated Connected Facility Location Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (A. Quesada-Arencibia, others, eds.), pages 261–263, 2011. |
| [139] | Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints Network Optimization: 5th International Conference, INOC 2011 (J. Pahl, T. Reiners, S. Voß, eds.), volume 6701 of LNCS, pages 105–117, 2011, Springer. |
| [138] | Automatic Generation of 2-AntWars Players with Genetic Programming Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 244–246, 2011. |
| [137] | An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 256–259, 2011. |
| [136] | A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS) (M. Ganzha, others, eds.), pages 239–246, 2011, IEEE Digital Library. |
| [135] | A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 247–249, 2011. |
| [134] | On Stabilized Branch-and-Price for Constrained Tree Problems 2011, Technical report TR 186–1–11–01, Vienna University of Technology. |
| 2010 | |
| [133] | The Multidimensional Knapsack Problem: Structure and Algorithms INFORMS Journal on Computing, volume 22, number 2, pages 250–265, 2010. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-07.pdf |
| [132] | The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search Networks, volume 55, number 3, pages 256–275, 2010. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/hu-07.pdf |
| [131] | Metaheuristic Hybrids Chapter in Handbook of Metaheuristics (Michel Gendreau, Jean Yves Potvin, eds.), volume 146 of International Series in Operations Research & Management Science, pages 469–496, 2010, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-08a.pdf |
| [130] | Trend-Based Similarity Search in Time-Series Data Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications – DBKDA 2010, pages 97–106, 2010, IEEE CPS. |
| [129] | A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa, others, eds.), volume 6373 of LNCS, pages 103–117, 2010, Springer. |
| [128] | Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem Parallel Problem Solving from Nature – PPSN XI, Part II (R. Schaefer, others, eds.), volume 6239 of LNCS, pages 391–400, 2010, Springer. |
| [127] | Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2010 (Peter Cowling, Peter Merz, eds.), volume 6022 of LNCS, pages 239–251, 2010, Springer. Note: best paper award winner |
| [126] | Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problem Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa, others, eds.), volume 6373 of LNCS, pages 174–189, 2010, Springer. |
| [125] | Matheuristics for the Periodic Vehicle Routing Problem with Time Windows Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics, pages 83–95, 2010. |
| [124] | Multilevel Variable Neighborhood Search for Periodic Routing Problems Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2010 (Peter Cowling, Peter Merz, eds.), volume 6022 of LNCS, pages 226–238, 2010, Springer. |
| [123] | A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem 2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design (F. Xhafa, others, eds.), pages 356–361, 2010, Conference Publishing Services. |
| [122] | Similarity Searching in Sequences of Complex Events Proceedings of the Fourth International Conference on Research Challenges in Information Science – RCIS 2010, pages 631–639, 2010, IEEE CPS. |
| [121] | Strong Lower Bounds for a Survivable Network Design Problem ISCO 2010 – International Symposium on Combinatorial Optimization (M. Haouari, A. R. Mahjoub, eds.), volume 36 of Electronic Notes in Discrete Mathematics, pages 295–302, 2010, Elsevier. |
| [120] | Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods, GEM 2010 (H. Arabnia, A. M. G. Solo, eds.), 2010, CSREA Press. |
| [119] | Fitting Multi-Planet Transit Models to Photometric Time-Data Series by Evolution Strategies GECCO 2010: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (Jürgen Branke, Martin Pelikan, eds.), pages 377–384, 2010, ACM Press. |
| [118] | A Brief Survey on Hybrid Metaheuristics Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications (B. Filipic, J. Silc, eds.), pages 3–16, 2010. |
| [117] | Branch-and-Cut-and-Price for Capacitated Connected Facility Location 2010, Technical report TR 186–1–10–01, Vienna University of Technology. |
| 2009 | |
| [116] | Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates Journal of Mathematical Modelling and Algorithms, volume 8, number 3, pages 293–334, 2009. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/chwatal-08a.pdf |
| [115] | MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo, T. Stützle, S. Voss, eds.), volume 10 of Annals of Information Systems, pages 71–102, 2009, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-09.pdf |
| [114] | Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location Chapter in Post-Conference Book of the Eight Metaheuristics International Conference – MIC 2009, 2009. Note: to appear |
| [113] | (Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo, T. Stützle, S. Voss, eds.), volume 10 of Annals of Information Systems, pages 209–230, 2009, Springer. |
| [112] | Hybrid Metaheuristics Chapter in CPAIOR 10th Anniversary (M. Milano, P. Van Hentenryck, eds.), 2009, Springer. Note: to appear |
| [111] | Accelerating Column Generation for a Survivable Network Design Problem Proceedings of the International Network Optimization Conference 2009 (M. G. Scutellá, others, eds.), Apr 2009. |
| [110] | Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation International Network Optimization Conference 2009 (Maria Grazia Scutellà, others, eds.), Apr 2009. |
| [109] | Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search Hybrid Metaheuristics 2009 (M. J. Blesa, others, eds.), volume 5818 of LNCS, pages 84–99, 2009, Springer. |
| [108] | A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Computer Aided Systems Theory – EUROCAST 2009 (R. Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 713–720, 2009, Springer. |
| [107] | A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 244–246, 2009. |
| [106] | Cooperative Hybrids for Combinatorial Optimization Nature Inspired Cooperative Strategies for Optimization (NICSO 2008) (Natalio Krasnogor, others, eds.), volume 236 of Studies in Computational Intelligence, pages X, 2009, Springer. Note: abstract |
| [105] | Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouses Logistik Management: Systeme, Methoden, Integration (Stefan Voss, others, eds.), pages 279–298, 2009, Physica Verlag. |
| [104] | Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents GECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl, others, eds.), pages 349–356, 2009, ACM Press. |
| [103] | A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2009 (Carlos Cotta, Peter Cowling, eds.), volume 5482 of LNCS, pages 25–36, 2009, Springer. |
| [102] | Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows Hybrid Metaheuristics 2009 (M. J. Blesa, others, eds.), volume 5818 of LNCS, pages 175–189, 2009, Springer. |
| [101] | Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques Proceedings of the 8th Metaheuristic International Conference (Stefan Voss, Marco Caserta, eds.), 2009. |
| [100] | A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows Proceedings of the International Network Optimization Conference 2009 (Maria Grazia Scutellà, others, eds.), 2009. |
| [99] | A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location Proceedings of the 8th Metaheuristics International Conference (Stefan Voss, Marco Caserta, eds.), 2009. |
| [98] | A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem 9th International Conference on Hybrid Intelligent Systems – HIS 2009, pages 63–68, 2009. Note: best paper award winner |
| [97] | Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances GECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl, others, eds.), pages 263–270, 2009, ACM Press. |
| [96] | Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics Computer Aided Systems Theory – EUROCAST 2009 (R. Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 665–672, 2009, Springer. |
| [95] | Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 228–231, 2009. |
| [94] | Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms Computer Aided Systems Theory – EUROCAST 2009 (R. Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 649–656, 2009, Springer. |
| [93] | Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 222–225, 2009. |
| [92] | Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms 02 2009, Poster presentation, First CoRoT International Symposium. |
| [91] | Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location 2009, Technical report TR 186–1–09–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2008 | |
| [90] | Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search Journal of Heuristics, volume 14, number 5, pages 457–472, 2008. |
| [89] | An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem European Journal of Operational Research, volume 191, number 3, pages 1004–1022, 2008. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/prandtstetter-05a.pdf |
| [88] | Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem Journal of Heuristics, volume 14, number 5, pages 473–499, 2008. |
| [87] | Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization Chapter in Hybrid Metaheuristics – An Emergent Approach for Combinatorial Optimization (C. Blum, M. J. Blesa Augilera, A. Roli, M. Sampels, eds.), volume 114 of Studies in Computational Intelligence, pages 31–62, 2008, Springer. |
| [86] | A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta, J. van Hemert, eds.), volume 153 of Studies in Computational Intelligence, pages 69–85, 2008, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf |
| [85] | A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Numerical Analysis and Applied Mathematics (T. E. Simos, others, eds.), volume 1048 of AIP Conference Proceedings, pages 446–449, 2008, American Institute of Physics. |
| [84] | Combining Forces to Reconstruct Strip Shredded Text Documents Hybrid Metaheuristics 2008 (M. J. Blesa, others, eds.), volume 5296 of LNCS, pages 175–189, 2008, Springer. |
| [83] | A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing (Caroline Prodhon, others, eds.), 2008. |
| [82] | Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations (J. Küng, K. Schneider, R. Wagner, eds.), volume 26 of Schriftenreihe Informatik, pages 115–124, 2008, Trauner Verlag. |
| [81] | Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms GECCO '08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (Maarten Keijzer, others, eds.), pages 323–330, 2008, ACM. |
| [80] | Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (Edmund Burke, others, eds.), 2008. |
| [79] | Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks Hybrid Metaheuristics 2008 (M. J. Blesa, others, eds.), volume 5296 of LNCS, pages 158–174, 2008, Springer. |
| [78] | Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 233–236, 2008, IEEE Computer Society. |
| [77] | Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem Proceedings of the 8th International Conference on Hybrid Intelligent Systems – HIS 2008 (Fatos Xhafa, others, eds.), pages 73–77, 2008. |
| [76] | Effective Neighborhood Structures for the Generalized Traveling Salesman Problem Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2008 (Jano van Hemert, Carlos Cotta, eds.), volume 4972 of LNCS, pages 36–47, 2008, Springer. Note: best paper award winner |
| [75] | (Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics (P. Hansen, others, eds.), 2008. |
| [74] | Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 261–264, 2008, IEEE Computer Society. |
| [73] | (Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem 2008, Technical report TR 186–1–08–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [72] | Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates Sep 2008, Technical report TR 186–1–08–01, Vienna University of Technology, Institute of Computer Graphics and Algorithms. |
| 2007 | |
| [71] | Models and Algorithms for Three-Stage Two-Dimensional Bin Packing European Journal of Operational Research, volume 183, number 3, pages 1304–1327, 2007. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-04b.pdf |
| [70] | CyMATE: A New Tool for Methylation Analysis of Plant Genomic DNA after Bisulfite Sequencing The Plant Journal, volume 51, number 3, pages 526–536, 2007. |
| [69] | A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz, ed.), pages 103/1–6, 2007. |
| [68] | A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks Operations Research Proceedings 2006 (Karl-Heinz Waldmann, Ulrike M. Stocker, eds.), 2007, Springer. |
| [67] | Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem Numerical Analysis and Applied Mathematics (T. E. Simos, ed.), volume 936 of AIP Conference Proceedings, pages 444–447, 2007, American Institute of Physics. |
| [66] | Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem Evolutionary Computation in Combinatorial Optimization – EvoCOP 2007 (Carlos Cotta, Jano van Hemert, eds.), volume 4446 of LNCS, pages 176–187, 2007, Springer. |
| [65] | Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz, ed.), pages 69/1–6, 2007. |
| [64] | Determining Orbital Elements of Extrasolar Planets by Evolution Strategies Computer Aided Systems Theory – EUROCAST 2007 (R. Moreno-Díaz, others, eds.), volume 4739 of LNCS, pages 870–877, 2007, Springer. |
| [63] | Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem Proceedings of MIC2007, the 7th Metaheuristics International Conference, pages 105/1–3, 2007. |
| [62] | A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem 2007, Technical report TR 186–1–07–03, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [61] | The Multidimensional Knapsack Problem: Structure and Algorithms 2007, Technical report TR 186–1–07–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [60] | The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search 2007, Technical report TR 186–1–07–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2006 | |
| [59] | Biased Mutation Operators for Subgraph-Selection Problems IEEE Transactions on Evolutionary Computation, volume 10, number 2, pages 145–156, 2006, IEEE Press. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-05.pdf |
| [58] | Cleaning of Raw Peptide MS/MS Spectra: Improved Protein Identification Following Deconvolution of Multiply Charged Peaks, Isotope Clusters, and Removal of Background Noise Proteomics, volume 6, number 19, pages 5117–5131, 2006, Wiley. |
| [57] | A Unified View on Hybrid Metaheuristics Proceedings of the Hybrid Metaheuristics Workshop (Francisco Almeida, others, eds.), volume 4030 of LNCS, pages 1–12, 2006, Springer. |
| [56] | The Core Concept for the Multidimensional Knapsack Problem Evolutionary Computation in Combinatorial Optimization – EvoCOP 2006 (Jens Gottlieb, Günther R. Raidl, eds.), volume 3906 of LNCS, pages 195–208, 2006, Springer. |
| [55] | Evolutionary Approach to Constrained Minimum Spanning Tree Problem Evolutionary Computation and Global Optimization 2006 (Jaroslawa Arabasa, ed.), pages 331–341, 2006. |
| [54] | Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics (Carlos Cotta, Antonio J. Fernandez, Jose E. Gallardo, eds.), 2006. |
| [53] | Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO Proceedings of the Genetic and Evolutionary Computation Conference – GECCO 2006 (Maarten Keijzer, others, eds.), pages 1187–1194, 2006, ACM. |
| [52] | Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search 2006, Technical report TR 186–1–06–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [51] | Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem 2006, Technical report TR 186–1–06–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2005 | |
| [50] | Evolutionary Computation: An Overview and Recent Trends ÖGAI Journal, volume 24, pages 2–7, 2005, Österreichische Gesellschaft für Artificial Intelligence. |
| [49] | Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem Evolutionary Computation Journal, volume 13, number 4, pages 441–475, 2005. |
| [48] | Relaxation Guided Variable Neighborhood Search Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. |
| [47] | Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem Proceedings of MIC2005, the 6th Metaheuristics International Conference, pages 775–780, 2005. |
| [46] | Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Part II, volume 3562 of LNCS, pages 41–53, 2005, Springer. |
| [45] | A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. |
| [44] | Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. |
| [43] | Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. |
| [42] | A New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem Proceedings of the 2nd International Network Optimization Conference 2005 (L Gouveia, C. Mourão, eds.), pages 178–185, 2005. |
| [41] | An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem 2005, Technical report TR 186–1–05–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2004 | |
| [40] | An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem Proceedings of the 2003 ACM Symposium on Applied Computing (H. M. Haddadd, others, eds.), pages 990–995, 2004, ACM Press. |
| [39] | An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing Parallel Problem Solving from Nature – PPSN VIII (X. Yao et. al, ed.), volume 3242 of LNCS, pages 642–651, 2004, Springer. |
| [38] | Solving a Real-World Glass Cutting Problem Evolutionary Computation in Combinatorial Optimization – EvoCOP 2004 (Jens Gottlieb, Günther R. Raidl, eds.), volume 3004 of LNCS, pages 162–173, 2004, Springer. |
| [37] | An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem Parallel Problem Solving from Nature – PPSN VIII (Xin Yao, others, eds.), volume 3242 of LNCS, pages 302–311, 2004, Springer-Verlag. |
| [36] | Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem Genetic and Evolutionary Computation – GECCO 2004 (K. Deb, others, eds.), volume 3102 of LNCS, pages 1304–1315, 2004, Springer. |
| [35] | Biased Mutation Operators for Subgraph-Selection Problems 2004, Technical report TR 186–1–04–06, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [34] | Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem 2004, Technical report TR 186–1–04–05, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| [33] | Models and Algorithms for Three-Stage Two-Dimensional Bin Packing 2004, Technical report TR 186–1–04–04, Institute of Computer Graphics and Algorithms, Vienna University of Technology. |
| 2003 | |
| [32] | Edge-Sets: An Effective Evolutionary Coding of Spanning Trees IEEE Transactions on Evolutionary Computation, volume 7, number 3, pages 225–239, 2003. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-01.pdf |
| [31] | A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs Journal of Heuristics, volume 9, pages 401–427, 2003, Kluwer Academic Publishers. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/ljubic-02.pdf |
| [30] | Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem Proceedings of the 2003 ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 747–752, 2003, ACM Press. |
| [29] | A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem in 2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Design of Representations (A. Barry, F. Rothlauf, D. Thierens, others, eds.), pages 2–7, 2003. Note: best paper award winner of the workshop |
| [28] | Hybrid Evolutionary Algorithms for Combinatorial Optimization Mar 2003, Habilitation thesis at the Vienna University of Technology. |
| 2002 | |
| [27] | Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem Information Processing Letters, volume 82, number 1, pages 39–45, 2002. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-02.pdf |
| [26] | Letting Ants Labeling Point Features Proceedings of the 2002 IEEE Congress on Evolutionary Computation (D. Fogel, others, eds.), pages 1564–1569, 2002, IEEE Press. |
| [25] | On Weight-Biased Mutation for Graph Problems Parallel Problem Solving from Nature – PPSN VII (J. J. Merelo Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacañas, H.-P. Schwefel, eds.), volume 2439 of LNCS, pages 204–213, 2002. |
| [24] | A Memetic Algorithm for Vertex-Biconnectivity Augmentation Applications of Evolutionary Computing: EvoWorkshops 2002 (S. Cagnoni, others, eds.), volume 2279 of LNCS, pages 102–111, 2002, Springer. |
| [23] | Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges Proceedings of the 2002 ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 547–552, 2002, ACM Press. |
| 2001 | |
| [22] | An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem Applications of Evolutionary Computing: EvoWorkshops 2001 (E. J.-W. Boers, others, eds.), volume 2037 of LNCS, pages 20–29, 2001, Springer. |
| [21] | Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems Proceedings of the 16th ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 321–326, 2001, ACM Press. |
| [20] | Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search Proceedings of the 2001 Genetic and Evolutionary Computation Conference (L. Spector, others, eds.), pages 343–350, 2001, Morgan Kaufmann. |
| 2000 | |
| [19] | An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Proceedings of the 2000 IEEE Congress on Evolutionary Computation (C. Fonseca, others, eds.), pages 104–111, 2000, IEEE Press. |
| [18] | A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, pages 309–316, 2000. |
| [17] | A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Proceedings of the 2000 ACM Symposium on Applied Computing (J. Carroll, others, eds.), pages 440–445, 2000, ACM Press. |
| [16] | A Hybrid GA for the Edge-Biconnectivity Augmentation Problem Parallel Problem Solving from Nature – PPSN VI (K. Deb, others, eds.), volume 1917 of LNCS, pages 641–650, 2000, Springer. |
| [15] | The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search Proceedings of the 2000 Genetic and Evolutionary Computation Conference (D. Whitley, others, eds.), pages 283–290, 2000, Morgan Kaufmann. |
| 1999 | |
| [14] | The Multiple Container Packing Problem: A Genetic Algorithm Approach with Weighted Codings ACM SIGAPP Applied Computing Review, volume 7, number 2, pages 22–31, 1999, ACM Press. |
| [13] | On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference (Scott Brave, Annie S. Wu, eds.), pages 204–211, 1999. |
| [12] | An Evolutionary Approach to Point-Feature Label Placement Proceedings of the 1999 Genetic and Evolutionary Computation Conference (Wolfgang Banzhaf, others, eds.), pages 807, 1999, Morgan Kaufmann. Note: short paper |
| [11] | Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem Proceedings of the 1999 IEEE Congress on Evolutionary Computation (Peter J. Angeline, others, eds.), pages 596–603, 1999, IEEE Press. |
| [10] | A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem Proceedings of the 1999 ACM Symposium on Applied Computing (Janice Carroll, others, eds.), pages 291–296, 1999, ACM Press. |
| [9] | Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem Proceedings of Artificial Evolution: Fourth European Conference (Cyril Fonlupt, others, eds.), volume 1829 of LNCS, pages 38–52, 1999, Springer. |
| 1998 | |
| [8] | Transforming an Analytically Defined Color Space to Match Psychophysically Gained Color Distances Proceedings of the SPIE's 10th International Symposium on Electronic Imaging: Science and Technology (G. B. Beretta, R. Eschbach, eds.), pages 98–106, 1998. |
| [7] | A Genetic Algorithm for Labeling Point Features Proceedings of the International Conference on Imaging Science, Systems and Technology (H. R. Arabnia, P.-C. Chung, J. B. Farison, G. R. Raidl, M. Sarfraz, Z. Zhang, eds.), pages 189–196, 1998, CSREA Press. |
| [6] | Approximation with Evolutionary Optimized Tensor Product Bernstein Polynomials Proceedings of the International Conference on Artificial Intelligence in Industry: From Theory to Practice (J. Sarnovsky, others, eds.), pages 247–256, 1998. |
| [5] | A Hybrid GP Approach for Numerically Robust Symbolic Regression Proceedings of the 3rd Annual Genetic Programming Conference (J. Koza, others, eds.), pages 323–328, 1998, Morgan Kaufmann. |
| [4] | An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem Proceedings of the 5th IEEE International Conference on Evolutionary Computation (D. Fogel, others, eds.), pages 207–211, 1998, IEEE Press. |
| [3] | Genetic Algorithms for the Multiple Container Packing Problem Proceedings of the 5th International Conference on Parallel Problem Solving from Nature – PPSN V (Agoston E. Eiben, others, eds.), volume 1498 of LNCS, pages 875–884, 1998, Springer. |
| [2] | Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks Proceedings of the International ICSC/IFAC Symposium on Neural Computation, pages 885–890, 1998. |
| 1994 | |
| [1] | Progressives, adaptives Ray-Tracing von Bildern mit hoher zeitlicher Kohärenz 1994, PhD thesis, Vienna University of Technology. |
