Günther Raidl
Ao.Univ.Prof. Dipl.-Ing. Dr.techn.

Günther Raidl

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.:

Some (more or less) recent major activities:

Finally, find here a detailed list of most of my past and present international organisational activities.

Projects

Recent Publications

A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs
Evolutionary Computation in Combinatorial Optimization (Krejca, Martin S. and Pillay, Nelishia), volume 16522 of LNCS, pages 133-149, 2026, Springer.
Complexity of Positive Influence Domination on Partial Grids
Fundamentals of Computation Theory—25th International Symposium (Jeż, Artur and Otop, Jan), volume 16106 of LNCS, pages 267-280, 2026, Springer.
Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs
Proceedings of the 12th International Network Optimization Conference, INOC 2026, Liège, Belgium (Fortz, Bernard), pages 17-20, 2026, OpenProceedings.org.
The Graph Burning Problem under Constrained Diffusion
Advances in Optimization and Wildfire (Alvelos, Filipe and Martins, Isabel and Rocha, Ana Maria A. C.), pages 139-154, 2026, Springer.
A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problem
Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 251-262, 2025, Springer.
Improvements in Large Neighborhood Search for the Electric Autonomous Dial-A-Ride Problem
Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 211-220, 2025, Springer.
Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding
Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 236-250, 2025, Springer.
Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime
Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 263-271, 2025, Springer.
Revisiting Large Neighborhood Search with On-the-Fly Charging Station Insertion for the Electric Autonomous Dial-a-Ride Problem
ACM Transactions on Evolutionary Learning and Optimization, 2025, Association for Computing Machinery.
Note: Just Accepted
Tackling the Alpha-Domination Problem Heuristically
Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 148-156, 2025, Springer.
A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem
Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2024 (T. Stützle and M. Wagner), volume 14632 of LNCS, pages 1-15, 2024, Springer.
Note: best paper award winner
A Simulated Annealing Based Approach for the Roman Domination Problem
Metaheuristics and Nature Inspired Computing (Dorronsoro, Bernabé and Ellaia, Rachid and Talbi, El-Ghazali), volume 2016 of CCIS, pages 28-43, 2024, Springer.
Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion
Proceedings of the Genetic and Evolutionary Computation Conference, pages 142-150, 2024, Association for Computing Machinery.
Note: best paper award winner of ECOM track
Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem
Metaheuristics and Nature Inspired Computing (Dorronsoro, Bernabé and Ellaia, Rachid and Talbi, El-Ghazali), pages 3-20, 2024, Springer.
Selecting User Queries in Interactive Job Scheduling
19th International Conference on Computer Aided Systems Theory, 2024, Springer.
Note: to appear
Signed double Roman domination on cubic graphs
Applied Mathematics and Computation, volume 471, pages 128612, 2024, Elsevier.
Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks
Machine Learning, Optimization, and Data Science. LOD 2023. (Nicosia, Giuseppe and Ojha, Varun and La Malfa, Emanuele and La Malfa, Gabriele and Pardalos, Panos M. and Umeton Renato), volume 14505 of lNCS, pages 24-38, 2024, Springer.
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 and Thomas Stützle), volume 13987 of LNCS, pages 50–65, 2023, Springer.
A Policy-Based Learning Beam Search for Combinatorial Optimization
Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Pérez Cáceres, Leslie and Stützle, Thomas), volume 13987 of LNCS, pages 130-145, 2023, Springer.
Note: best paper award winner
A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem
Computer Aided Systems Theory – EUROCAST 2022 (Roberto Moreno-Díaz and Franz Pichler and Alexis Quesada-Arencibia), volume 13789 of LNCS, pages 87-95, 2023, Springer.
An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles
EvoApplications 2023: Applications of Evolutionary Computation (Correia, J. and Smith, S. and Qaddoura, R.), volume 13989 of LNCS, pages 3-18, 2023, Springer.
Interactive Job Scheduling with Partially Known Personnel Availabilities
OLA 2023: Optimization and Learning (Dorronsoro, B. and Chicano, F. and Danoy, G. and Talbi, E.-G.), volume 1824 of Communications in Computer and Information Science, pages 236-247, 2023, Springer.
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.
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 and others), pages 32-33, February 2022.
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Evolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings (Leslie Pérez Cáceres and Sébastien Vérel), volume 13222 of Lecture Notes in Computer Science, pages 127-142, 2022, Springer.
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Pérez Cáceres, Leslie and Verel, Sébastien), volume 13222 of LNCS, pages 127-142, 2022, Springer.
Note: best paper award winner
A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications
Metaheuristics and Nature Inspired Computing (Dorronsoro, Bernabé and Yalaoui, Farouk and Talbi, El-Ghazali and Danoy, Grégoire), volume 1541 of CCIS, pages 3-17, 2022, Springer.
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.
A Learning Large Neighborhood Search for the Staff Rerostering Problem
Integration of Constraint Programming, Artificial Intelligence, and Operations Research – CPAIOR 2022 (Schaus, Pierre), volume 13292 of LNCS, pages 300-317, 2022, Springer.
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 and others), pages 22-23, 2022.
Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems
Machine Learning, Optimization, and Data Science, LOD 2021 (Nicosia, Giuseppe and Ojha, Varun and La Malfa, Emanuele and La Malfa, Gabriele and Jansen, Giorgio and Pardalos, Panos M. and Giuffrida, Giovanni and Umeton, Renato), volume 13164 of LNCS, pages 283-298, 2022, Springer.
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 and others), pages 20-21, 2022.
Parallel Beam Search for Combinatorial Optimization
Fifteenth International Symposium on Combinatorial Search (SoCS 2022), pages 273-275, 2022, AAAI.
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 r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf
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 r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf
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.
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), volume 12735 of LNCS, pages 72-88, 2021, Springer.
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), volume 12735 of LNCS, pages 283-298, 2021, Springer.
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.
A Beam Search Approach to the Traveling Tournament Problem
Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020 (Luís Paquete and Christine Zarges), volume 12102 of LNCS, pages 67-82, 2020, Springer.
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 (Nicosia, Giuseppe and Pardalos, Panos and Giuffrida, Giovanni and Umeton, Renato and Sciacca, Vincenzo), volume 11943 of LNCS, pages 154-167, 2020, Springer.
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 and Ender Özcan and Greet Vanden Berghe), 2020.
A Model for Finding Transition-Minors
Discrete Applied Mathematics, volume 228, pages 242-264, 2020.
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 (Bäck, Thomas and Preuss, Mike and Deutz, André and Wang, Hao and Doerr, Carola and Emmerich, Michael and Trautmann, Heike), volume 12270 of LNCS, pages 385-398, 2020, Springer.
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 r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf
Casual Employee Scheduling with Constraint Programming and Metaheuristics
Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz and Franz Pichler and Alexis Quesada-Arencibia), volume 12013 of LNCS, pages 279-287, 2020, Springer.
Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem
Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz and Franz Pichler and Alexis Quesada-Arencibia), volume 12013 of LNCS, pages 344-351, 2020, Springer.
Distributing Battery Swapping Stations for Electric Scooters in an Urban Area
Optimization and Applications, Proceedings of OPTIMA~2020 – XI International Conference Optimization and Applications (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 150-165, 2020, Springer.
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 and Panos Pardalos and Renato Umeton and Giovanni Giuffrida and Vincenzo Sciacca), volume 11943 of LNCS, pages 738-750, 2020, Springer.
Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers
Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia and Panos Pardalos and Renato Umeton and Giovanni Giuffrida and Vincenzo Sciacca), volume 11943 of LNCS, pages 445-457, 2020, Springer.
On Solving a Generalized Constrained Longest Common Subsequence Problem
Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 55-79, 2020, Springer.
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences
Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 134-149, 2020, Springer.
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 r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf
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 and others), pages 70-71, February 2019.
A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem
Proceedings of AI 2019: Advances in Artificial Intelligence (Liu, Jixue and Bailey, James), volume 11919 of LNCS, pages 549-560, 2019, Springer.
A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
Evolutionary Computation in Combinatorial Optimization (Liefooghe, Arnaud and Paquete, Luís), volume 11452 of LNCS, pages 1-16, 2019, Springer.
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem
Proceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 12013 of LNCS, pages 429-437, 2019, Springer.
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
A Memetic Algorithm for Competitive Facility Location Problems
Chapter in Business and Consumer Analytics: New Ideas, pages 637-660, 2019, Springer.
A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems
Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, and Yannis Marinakis and Panos Pardalos), volume 11968 of LNCS, pages 184-200, 2019, Springer.
A SAT Approach for Finding Sup-Transition-Minors
Learning and Intelligent Optimization. LION~2019, volume 11968 of LNCS, pages 325-341, 2019, Springer.
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 and others), pages 78-79, 2019.
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 and others), pages 94-95, 2019.
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.
Finding Longest Common Subsequences: New A* Anytime Results
2019, Technical report AC-TR-19-008, Algorithms and Complexity Group, TU Wien.
Metaheuristic Hybrids
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), pages 385-417, 2019, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf
Strategies for Iteratively Refining Layered Graph Models
Hybrid Metaheuristics: 11th International Workshop, HM 2019 (Blesa Aguilera, M. J. and Blum, C. and Gambini Santos, H. and Pinacho-Davidson, P. and Godoy del Campo, J.), volume 11299 of LNCS, pages 46-62, 2019, Springer.
Towards Improving Merging Heuristics for Binary Decision Diagrams
Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis and Yannis Marinakis and Panos Pardalos), volume 11968 of LNCS, pages 30-45, 2019, Springer.
A Model for Finding Transition-Minors
2018, Technical report AC-TR-18-009, Algorithms and Complexity Group, TU Wien.
A SAT Approach for Finding Sup-Transition-Minors
2018, Technical report AC-TR-18-010, Algorithms and Complexity Group, TU Wien.
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.
Finding Smooth Graphs with Small Independence Numbers
MOD~2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giuffrida, Giovanni and Nicosia, Giuseppe and Pardalos, Panos and Umeton, Renato), volume 10710 of LNCS, pages 527-539, 2018, Springer.
GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection
Computer Aided Systems Theory – EUROCAST 2017, Part I (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 10671 of LNCS, pages 299-306, 2018, Springer.
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.
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 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 10671 of LNCS, pages 355-363, 2018, Springer.
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 and Ivana Ljubić and Georg Pflug and Gernot Tragler), pages 393-399, 2017, Springer.
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 and Ivana Ljubić and Georg Pflug and Gernot Tragler), pages 385-391, 2017, Springer.
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 (Hu, Bin and López-Ibáñez, Manuel), volume 10197 of LNCS, pages 91-107, 2017, Springer.
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 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), 2017.
Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem
Conference Proceedings of Learning and Intelligent Optimization Conference (LION~11) (Roberto Battiti and Dmitri Kvasov and Yaroslav Sergeyev), volume 10556 of LNCS, pages 1-16, 2017, Springer.
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 (Giuffrida, Giovanni and Nicosia, Giuseppe and Pardalos, Panos and Umeton, Renato), volume 10710 of LNCS, pages 506-518, 2017, Springer.
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) (Quesada-Arencibia, Alexis and Rodríguez, José Carlos and Moreno-D\áz, Roberto), pages 106-107, 2017.
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) (Quesada-Arencibia, Alexis and Rodríguez, José Carlos and Moreno-D\áz, Roberto), pages 104-105, 2017.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/infuehr-14.pdf
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
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
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/blum-15.pdf
Districting and Routing for Security Control
Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa and Christian Blum and Angelo Cangelosi and Vicenzo Cutello and Alessandro Di Nuovo and Mario Pavone and El-Ghazali Talbi), volume 9668 of LNCS, pages 87-103, 2016, Springer.
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers
Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa and Christian Blum and Angelo Cangelosi and Vicenzo Cutello and Alessandro Di Nuovo and Mario Pavone and El-Ghazali Talbi), volume 9668 of LNCS, pages 1-16, 2016, Springer.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/biesinger-14b.pdf
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.
Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition
2016, Technical report AC-TR-16-007, Algorithms and Complexity Group, TU Wien.
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 and V. Maniezzo), pages 104-107, 2016.
Numerische Optimierung elektrifizierter Antriebsstränge
Motortechnische Zeitschrift (MTZ), volume 03, pages 66-74, March 2015, Springer.
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 and José Carlos Rodriguez and Roberto Moreno-Díaz jr. and Roberto Moreno-D\áz), pages 125-126, 2015.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/biesinger-14.pdf
A New Solution Representation for the Firefighter Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2015 (Ochoa, Gabriela and Chicano, Francisco), volume 9026 of LNCS, pages 25-35, 2015, Springer.
A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles
Computer Aided Systems Theory – EUROCAST 2015 (Moreno-Díaz, Roberto and others), volume 9520 of LNCS, pages 425-432, 2015, Springer International Publishing Switzerland.
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 and others), pages 119-120, 2015.
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.
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 and José Carlos Rodriguez and Roberto Moreno-Díaz jr. and Roberto Moreno-D\áz), pages 109-110, 2015.
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2015 (Ochoa, Gabriela and Chicano, Francisco), volume 9026 of LNCS, pages 48-60, 2015, Springer.
Decomposition Based Hybrid Metaheuristics
European Journal of Operational Research, volume 244, pages 66-76, 2015.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-15.pdf
Heuristic Approaches for the Probabilistic Traveling Salesman Problem
Computer Aided Systems Theory – EUROCAST 2015 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 9520 of LNCS, pages 342-349, 2015, Springer International Publishing Switzerland.
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 and others), pages 99 - 100, 2015.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/hiermann-13.pdf
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.
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 and others), pages 1-8, 2015, IEEE Xplore.
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.
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 and others), pages 691-696, 2014, Department of Transportation, University of Zagreb.
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 and Christain Blum and Stefan Voß), volume 8457 of LNCS, pages 85-99, 2014, Springer.
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.
Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid
Parallel Problem Solving from Nature – PPSN XIII (Bartz-Beielstein, Thomas and Branke, Jürgen and Filipic, Bogdan and Smith, Jim), volume 8672 of LNCS, pages 792-801, 2014, Springer.
Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2014 (Blum, Christian and Ochoa, Gabriela), volume 8600 of LNCS, pages 73-84, 2014, Springer.
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.
Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles
Chapter in Applications of Evolutionary Computation (Esparcia-Alcázar, Anna I. and Mora, Antonio M.), pages 553-564, 2014, Springer.
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 and Christain Blum and Stefan Voß), volume 8457 of LNCS, pages 183-197, 2014, Springer.
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.
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.
A Memetic Algorithm for the Virtual Network Mapping Problem
Proceedings of the 10th Metaheuristics International Conference (H.C. Lau and P. Van Hentenryck and G.R. Raidl), pages 28/1-28/10, 2013.
A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem
Computer Aided Systems Theory – EUROCAST 2013 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 8111 of LNCS, pages 219-226, 2013, Springer.
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.
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.
A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems
Computer Aided Systems Theory – EUROCAST 2013 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 8111 of LNCS, pages 372-379, 2013, Springer.
A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables
Chapter in Advances in Metaheuristics (Luca Di~Gaspero and Andrea Schaerf and Thomas Stützle), volume 53 of Operations Research/Computer Science Interfaces Series, pages 143-158, 2013, Springer.
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.
Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach
Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP~2013 (M. Middendorf and C. Blum), volume 7832 of LNCS, pages 121-132, 2013, Springer.
Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations
Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa and others), volume 7919 of LNCS, pages 130-143, 2013, Springer.
Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem
Proceedings of the 10th Metaheuristics International Conference (H.C. Lau and P. Van Hentenryck and G.R. Raidl), pages 30/1-30/10, 2013.
Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents
Computer Aided Systems Theory – EUROCAST 2013 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 8111 of LNCS, pages 380-387, 2013, Springer.
GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem
Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa and others), volume 7919 of LNCS, pages 159-173, 2013, Springer.
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.
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.
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 and C. Blum), volume 7832 of LNCS, pages 250-261, 2013, Springer.
Stabilizing Branch-and-Price for Constrained Tree Problems
Networks, volume 61, number 2, pages 150-170, 2013.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/leitner-11e.pdf
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 and others), volume 6927 of LNCS, pages 351-358, 2012, Springer.
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 and F. Pichler and A. Quesada-Arencibia), volume 6927 of LNCS, pages 256-263, 2012, Springer.
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2012 (J.-K. Hao and M. Middendorf), volume 7245 of LNCS, pages 13-24, 2012, Springer, Heidelberg.
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 and F. Pichler and A. Quesada-Arencibia), volume 6927 of LNCS, pages 287-294, 2012, Springer.
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.
Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles
Applications of Evolutionary Computation – EvoApplications~2012 (C. Di~Chio and others), volume 7248 of LNCS, pages 376-385, 2012, Springer, Heidelberg.
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 and F. Pichler and A. Quesada-Arencibia), volume 6927 of LNCS, pages 248-255, 2012, Springer.
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 and Narendra Jussien and Éric Pinson), pages 339-355, 2012, Springer.
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 and others), volume 6927 of LNCS, pages 392-399, 2012, Springer.
On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem
Proceedings of the 2nd International Symposium on Combinatorial Optimization (Mahjoub, A.R. and others), volume 7422 of LNCS, pages 225-236, 2012, Springer.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/nothegger-12.pdf
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 and others), volume 6927 of LNCS, pages 295-302, 2012, Springer.
Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design
Parallel Problem Solving from Nature–PPSN XII (C. A. Coello Coello and others), volume 7492 of LNCS, pages 458-467, 2012, Springer.
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
Network Optimization: 5th International Conference, INOC 2011 (J. Pahl and T. Reiners and S. Voß), volume 6701 of LNCS, pages 124-138, June 2011, Springer.
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.
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 and others), pages 239-246, 2011, IEEE Digital Library.
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 and G.J. Woeginger), volume 6655 of LNCS, pages 376-388, 2011, Springer, Heidelberg.
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 and others), pages 247-249, 2011.
A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables
Proceedings of the 9th Metaheuristics International Conference (Luca Di~Gaspero and Andrea Schaerf and Thomas Stützle), pages 349-358, 2011.
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 and others), pages 256-259, 2011.
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 and others), pages 244-246, 2011.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/leitner-10b.pdf
Hybrid Metaheuristics in Combinatorial Optimization: A Survey
Applied Soft Computing, volume 11, pages 4135-4151, 2011.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/blum-11.pdf
Improved Packing and Routing of Vehicles with Compartments
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia and others), pages 302-304, 2011.
Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints
Network Optimization: 5th International Conference, INOC 2011 (J. Pahl and T. Reiners and S. Voß), volume 6701 of LNCS, pages 105-117, 2011, Springer.
On Stabilized Branch-and-Price for Constrained Tree Problems
2011, Technical report TR 186-1-11-01, Vienna University of Technology.
Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments
Proceedings of the 9th Metaheuristics International Conference (Luca Di~Gaspero and Andrea Schaerf and Thomas Stützle), pages 679-681, 2011.
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 and others), pages 285-287, 2011.
Variable Neighborhood Search for Capacitated Connected Facility Location
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (A. Quesada-Arencibia and others), pages 261-263, 2011.
A Brief Survey on Hybrid Metaheuristics
Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications (B. Filipic and J. Silc), pages 3-16, 2010.
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents
Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa and others), volume 6373 of LNCS, pages 103-117, 2010, Springer.
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 and others), pages 356-361, 2010, Conference Publishing Services.
Branch-and-Cut-and-Price for Capacitated Connected Facility Location
2010, Technical report TR 186-1-10-01, Vienna University of Technology.
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling and Peter Merz), volume 6022 of LNCS, pages 239-251, 2010, Springer.
Note: best paper award winner
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 and Martin Pelikan), pages 377-384, 2010, ACM Press.
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.
Metaheuristic Hybrids
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), volume 146 of International Series in Operations Research & Management Science, pages 469-496, 2010, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-08a.pdf
Multilevel Variable Neighborhood Search for Periodic Routing Problems
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling and Peter Merz), volume 6022 of LNCS, pages 226-238, 2010, Springer.
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.
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 and A. M. G. Solo), 2010, CSREA Press.
Strong Lower Bounds for a Survivable Network Design Problem
ISCO 2010 – International Symposium on Combinatorial Optimization (M. Haouari and A. R. Mahjoub), volume 36 of Electronic Notes in Discrete Mathematics, pages 295-302, 2010, Elsevier.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/hu-07.pdf
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-07.pdf
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.
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 and others), volume 6239 of LNCS, pages 391-400, 2010, Springer.
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 and others), volume 6373 of LNCS, pages 174-189, 2010, Springer.
Accelerating Column Generation for a Survivable Network Design Problem
Proceedings of the International Network Optimization Conference 2009 (M. G. Scutellá and others), April 2009.
Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation
International Network Optimization Conference 2009 (Maria Grazia Scutellà and others), April 2009.
(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 and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 209-230, 2009, Springer.
A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows
Proceedings of the International Network Optimization Conference 2009 (Maria Grazia Scutellà and others), 2009.
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2009 (Carlos Cotta and Peter Cowling), volume 5482 of LNCS, pages 25-36, 2009, Springer.
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz and others), volume 5717 of LNCS, pages 713-720, 2009, Springer.
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 and others), pages 244-246, 2009.
A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location
Proceedings of the 8th Metaheuristics International Conference (Stefan Voss and Marco Caserta), 2009.
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
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 and others), pages 228-231, 2009.
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.
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
Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouses
Logistik Management: Systeme, Methoden, Integration (Stefan Voss and others), pages 279-298, 2009, Physica Verlag.
Cooperative Hybrids for Combinatorial Optimization
Nature Inspired Cooperative Strategies for Optimization (NICSO 2008) (Natalio Krasnogor and others), volume 236 of Studies in Computational Intelligence, pages X, 2009, Springer.
Note: abstract
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 and others), pages 263-270, 2009, ACM Press.
Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms
Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz and others), volume 5717 of LNCS, pages 649-656, 2009, Springer.
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 and others), pages 222-225, 2009.
Hybrid Metaheuristics
Chapter in CPAIOR 10th Anniversary (M. Milano and P. Van Hentenryck), 2009, Springer.
Note: to appear
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 and others), pages 349-356, 2009, ACM Press.
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 71-102, 2009, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-09.pdf
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/chwatal-08a.pdf
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz and others), volume 5717 of LNCS, pages 665-672, 2009, Springer.
Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates
September 2008, Technical report TR 186-1-08-01, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
(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 and others), 2008.
(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.
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 and J. van~Hemert), volume 153 of Studies in Computational Intelligence, pages 69-85, 2008, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf
A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
Numerical Analysis and Applied Mathematics (T. E. Simos and others), volume 1048 of AIP Conference Proceedings, pages 446-449, 2008, American Institute of Physics.
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 and others), 2008.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/prandtstetter-05a.pdf
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
Chapter in Hybrid Metaheuristics – An Emergent Approach for Combinatorial Optimization (C. Blum and M. J. Blesa Augilera and A. Roli and M. Sampels), volume 114 of Studies in Computational Intelligence, pages 31-62, 2008, Springer.
Combining Forces to Reconstruct Strip Shredded Text Documents
Hybrid Metaheuristics 2008 (M. J. Blesa and others), volume 5296 of LNCS, pages 175-189, 2008, Springer.
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2008 (Jano van Hemert and Carlos Cotta), volume 4972 of LNCS, pages 36-47, 2008, Springer.
Note: best paper award winner
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 and K. Schneider and R. Wagner), volume 26 of Schriftenreihe Informatik, pages 115-124, 2008, Trauner Verlag.
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 and others), pages 323-330, 2008, ACM.
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.
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks
Hybrid Metaheuristics 2008 (M. J. Blesa and others), volume 5296 of LNCS, pages 158-174, 2008, Springer.
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 and others), 2008.
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 and others), pages 73-77, 2008.
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.
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), pages 103/1-6, 2007.
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.
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2007 (Carlos Cotta and Jano van~Hemert), volume 4446 of LNCS, pages 176-187, 2007, Springer.
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.
Determining Orbital Elements of Extrasolar Planets by Evolution Strategies
Computer Aided Systems Theory – EUROCAST 2007 (R. Moreno-Díaz and others), volume 4739 of LNCS, pages 870-877, 2007, Springer.
Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem
Numerical Analysis and Applied Mathematics (T. E. Simos), volume 936 of AIP Conference Proceedings, pages 444-447, 2007, American Institute of Physics.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-04b.pdf
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.
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.
Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem
Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz), pages 69/1-6, 2007.
A Unified View on Hybrid Metaheuristics
Proceedings of the Hybrid Metaheuristics Workshop (Francisco Almeida and others), volume 4030 of LNCS, pages 1-12, 2006, Springer.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-05.pdf
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.
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.
Evolutionary Approach to Constrained Minimum Spanning Tree Problem
Evolutionary Computation and Global Optimization 2006 (Jaroslawa Arabasa), pages 331-341, 2006.
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 and others), pages 1187-1194, 2006, ACM.
The Core Concept for the Multidimensional Knapsack Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2006 (Jens Gottlieb and Günther R. Raidl), volume 3906 of LNCS, pages 195-208, 2006, Springer.
Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering
Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics (Carlos Cotta and Antonio J. Fernandez and Jose E. Gallardo), 2006.
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 and C. Mourão), pages 178-185, 2005.
A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
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.
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.
Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
Evolutionary Computation: An Overview and Recent Trends
̈OGAI Journal, volume 24, pages 2-7, 2005, Österreichische Gesellschaft für Artificial Intelligence.
Relaxation Guided Variable Neighborhood Search
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
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), volume 3242 of LNCS, pages 642-651, 2004, Springer.
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem
Parallel Problem Solving from Nature – PPSN~VIII (Xin Yao and others), volume 3242 of LNCS, pages 302-311, 2004, Springer-Verlag.
An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem
Proceedings of the 2003 ACM Symposium on Applied Computing (H. M. Haddadd and others), pages 990-995, 2004, ACM Press.
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.
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
Genetic and Evolutionary Computation – GECCO 2004 (K.~ Deb and others), volume 3102 of LNCS, pages 1304-1315, 2004, Springer.
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.
Solving a Real-World Glass Cutting Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2004 (Jens Gottlieb and Günther R. Raidl), volume 3004 of LNCS, pages 162-173, 2004, Springer.
Hybrid Evolutionary Algorithms for Combinatorial Optimization
March 2003, Habilitation thesis at the Vienna University of Technology.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/ljubic-02.pdf
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 and F. Rothlauf and D. Thierens and others), pages 2-7, 2003.
Note: best paper award winner of the workshop
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-01.pdf
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 and others), pages 747-752, 2003, ACM Press.
A Memetic Algorithm for Vertex-Biconnectivity Augmentation
Applications of Evolutionary Computing: EvoWorkshops 2002 (S. Cagnoni and others), volume 2279 of LNCS, pages 102-111, 2002, Springer.
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 r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-02.pdf
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 and others), pages 547-552, 2002, ACM Press.
Letting Ants Labeling Point Features
Proceedings of the 2002 IEEE Congress on Evolutionary Computation (D. Fogel and others), pages 1564-1569, 2002, IEEE Press.
On Weight-Biased Mutation for Graph Problems
Parallel Problem Solving from Nature – PPSN VII (J. J. Merelo Guervos and P. Adamidis and H.-G. Beyer and J.-L. Fernández-Villacañas and H.-P. Schwefel), volume 2439 of LNCS, pages 204-213, 2002.
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Applications of Evolutionary Computing: EvoWorkshops 2001 (E. J.-W. Boers and others), volume 2037 of LNCS, pages 20-29, 2001, Springer.
Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search
Proceedings of the 2001 Genetic and Evolutionary Computation Conference (L. Spector and others), pages 343-350, 2001, Morgan Kaufmann.
Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems
Proceedings of the 16th ACM Symposium on Applied Computing (G. Lamont and others), pages 321-326, 2001, ACM Press.
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
Parallel Problem Solving from Nature – PPSN VI (K. Deb and others), volume 1917 of LNCS, pages 641-650, 2000, Springer.
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.
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 and others), pages 440-445, 2000, ACM Press.
An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
Proceedings of the 2000 IEEE Congress on Evolutionary Computation (C. Fonseca and others), pages 104-111, 2000, IEEE Press.
The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search
Proceedings of the 2000 Genetic and Evolutionary Computation Conference (D. Whitley and others), pages 283-290, 2000, Morgan Kaufmann.
A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem
Proceedings of the 1999 ACM Symposium on Applied Computing (Janice Carroll and others), pages 291-296, 1999, ACM Press.
An Evolutionary Approach to Point-Feature Label Placement
Proceedings of the 1999 Genetic and Evolutionary Computation Conference (Wolfgang Banzhaf and others), pages 807, 1999, Morgan Kaufmann.
Note: short paper
Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
Proceedings of Artificial Evolution: Fourth European Conference (Cyril Fonlupt and others), volume 1829 of LNCS, pages 38-52, 1999, Springer.
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 and Annie S. Wu), pages 204-211, 1999.
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.
Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem
Proceedings of the 1999 IEEE Congress on Evolutionary Computation (Peter J. Angeline and others), pages 596-603, 1999, IEEE Press.
A Genetic Algorithm for Labeling Point Features
Proceedings of the International Conference on Imaging Science, Systems and Technology (H.~R.~Arabnia and P.-C.~Chung and J.~B.~Farison and G.~R.~Raidl and M. Sarfraz and Z. Zhang), pages 189-196, 1998, CSREA Press.
A Hybrid GP Approach for Numerically Robust Symbolic Regression
Proceedings of the 3rd Annual Genetic Programming Conference (J. Koza and others), pages 323-328, 1998, Morgan Kaufmann.
An Improved Genetic Algorithm for the Multiconstrained 0--1 Knapsack Problem
Proceedings of the 5th IEEE International Conference on Evolutionary Computation (D. Fogel and others), pages 207-211, 1998, IEEE Press.
Approximation with Evolutionary Optimized Tensor Product Bernstein Polynomials
Proceedings of the International Conference on Artificial Intelligence in Industry: From Theory to Practice (J. Sarnovsky and others), pages 247-256, 1998.
Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks
Proceedings of the International ICSC/IFAC Symposium on Neural Computation, pages 885-890, 1998.
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 and others), volume 1498 of LNCS, pages 875-884, 1998, Springer.
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 and R. Eschbach), pages 98-106, 1998.
Parallel Beam Search for Combinatorial Optimization
Workshop Proceedings of the International Conference on Parallel Processing (ICPP 2022), pages 1-8, ACM Press.