Günther R. Raidl

According to our database1, Günther R. Raidl authored at least 173 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem.
Int. Trans. Oper. Res., 2020

Particle therapy patient scheduling with limited starting time variations of daily treatments.
Int. Trans. Oper. Res., 2020

A model for finding transition-minors.
Discret. Appl. Math., 2020

Anytime algorithms for the longest common palindromic subsequence problem.
Comput. Oper. Res., 2020

Finding Longest Common Subsequences: New anytime A∗ search results.
Appl. Soft Comput., 2020

A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three.
Appl. Math. Comput., 2020

A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

A Beam Search Approach to the Traveling Tournament Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2020

2019
Job sequencing with one common and multiple secondary resources: An A<sup>⁎</sup>/Beam Search based anytime algorithm.
Artif. Intell., 2019

Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications.
Proceedings of the Machine Learning, Optimization, and Data Science, 2019

Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers.
Proceedings of the Machine Learning, Optimization, and Data Science, 2019

A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation.
Proceedings of the Machine Learning, Optimization, and Data Science, 2019

A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

A SAT Approach for Finding Sup-Transition-Minors.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

Towards Improving Merging Heuristics for Binary Decision Diagrams.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

Strategies for Iteratively Refining Layered Graph Models.
Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019

A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2019

VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2019, 2019

Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2019, 2019

Casual Employee Scheduling with Constraint Programming and Metaheuristics.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2019, 2019

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2019, 2019

A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem.
Proceedings of the AI 2019: Advances in Artificial Intelligence, 2019

A Memetic Algorithm for Competitive Facility Location Problems.
Proceedings of the Business and Consumer Analytics: New Ideas, 2019

2018
A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands.
Transp. Sci., 2018

Solving a selective dial-a-ride problem with logic-based Benders decomposition.
Comput. Oper. Res., 2018

Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

2017
Large neighborhood search for the most strings with few bad columns problem.
Soft Comput., 2017

Full-load route planning for balancing bike sharing systems by logic-based benders decomposition.
Networks, 2017

Finding Smooth Graphs with Small Independence Numbers.
Proceedings of the Machine Learning, Optimization, and Big Data, 2017

Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment.
Proceedings of the Machine Learning, Optimization, and Big Data, 2017

Refining Partial Invalidations for Indexed Algebraic Dynamic Programming.
Proceedings of the Machine Learning, Optimization, and Big Data, 2017

Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem.
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2017

Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2017, 2017

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2017, 2017

GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2017, 2017

2016
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem.
Optim. Lett., 2016

New developments in metaheuristics and their applications - Selected extended contributions from the 10th Metaheuristics International Conference (MIC 2013).
J. Heuristics, 2016

A memetic algorithm for the virtual network mapping problem.
J. Heuristics, 2016

A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design.
Electron. Notes Discret. Math., 2016

An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands.
Electron. Notes Discret. Math., 2016

Models and algorithms for competitive facility location problems with different customer behavior.
Ann. Math. Artif. Intell., 2016

Districting and Routing for Security Control.
Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers.
Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016

Hybrid Metaheuristics - Powerful Tools for Optimization
Artificial Intelligence: Foundations, Theory, and Algorithms, Springer, ISBN: 978-3-319-30883-8, 2016

2015
PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems.
J. Glob. Optim., 2015

A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem.
J. Heuristics, 2015

Decomposition based hybrid metaheuristics.
Eur. J. Oper. Res., 2015

Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search.
Electron. Notes Discret. Math., 2015

Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure.
Electron. Notes Discret. Math., 2015

Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search.
Electron. Notes Discret. Math., 2015

Metaheuristics for solving a multimodal home-healthcare scheduling problem.
Central Eur. J. Oper. Res., 2015

A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem.
Proceedings of the Operations Research Proceedings 2015, 2015

A Scalable Approach for the <i>K</i>-Staged Two-Dimensional Cutting Stock Problem.
Proceedings of the Operations Research Proceedings 2015, 2015

Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

On solving the most strings with few bad columns problem: An ILP model and heuristics.
Proceedings of the International Symposium on Innovations in Intelligent SysTems and Applications, 2015

A New Solution Representation for the Firefighter Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015

A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015

Heuristic Approaches for the Probabilistic Traveling Salesman Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2015, 2015

On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi Layer Hierarchical Ring Network Design Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2015, 2015

CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2015, 2015

A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2015, 2015

A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2015, 2015

A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2015, 2015

2014
A Memetic Algorithm for Multi Layer Hierarchical Ring Network Design.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior.
Proceedings of the Learning and Intelligent Optimization, 2014

Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem.
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014

A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem.
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014

Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case.
Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles.
Proceedings of the Applications of Evolutionary Computation - 17th European Conference, 2014

2013
Stabilizing branch-and-price for constrained tree problems.
Networks, 2013

Using Optimized Virtual Network Embedding for Network Dimensioning.
Proceedings of the 2013 Conference on Networked Systems, 2013

Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations.
Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem.
Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013

Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013

A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2013, 2013

A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2013, 2013

Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2013, 2013

2012
Solving the post enrolment course timetabling problem by ant colony optimization.
Ann. Oper. Res., 2012

Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles.
Proceedings of the Applications of Evolutionary Computation, 2012

Hybrid Heuristics for Multimodal Homecare Scheduling.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2011
Branch-and-Cut-and-Price for Capacitated Connected Facility Location.
J. Math. Model. Algorithms, 2011

Hybrid metaheuristics in combinatorial optimization: A survey.
Appl. Soft Comput., 2011

Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques.
Adv. Oper. Res., 2011

A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints.
Proceedings of the Network Optimization - 5th International Conference, 2011

A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011

Improved Packing and Routing of Vehicles with Compartments.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011

Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011

Automatic Generation of 2-AntWars Players with Genetic Programming.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011

An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011

A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011

2010
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics.
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem.
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search.
Networks, 2010

The Multidimensional Knapsack Problem: Structure and Algorithms.
INFORMS J. Comput., 2010

Strong Lower Bounds for a Survivable Network Design Problem.
Electron. Notes Discret. Math., 2010

Similarity Searching in Sequences of Complex Events.
Proceedings of the Fourth IEEE International Conference on Research Challenges in Information Science, 2010

Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Proceedings of the Parallel Problem Solving from Nature, 2010

A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem.
Proceedings of the 2nd International Conference on Intelligent Networking and Collaborative Systems, 2010

A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization.
Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods, 2010

Fitting multi-planet transit models to photometric time-data series by evolution strategies.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010

Multilevel Variable Neighborhood Search for Periodic Routing Problems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010

Trend-Based Similarity Search in Time-Series Data.
Proceedings of the Second International Conference on Advances in Databases, 2010

2009
Solving a <i>k</i>-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates.
J. Math. Model. Algorithms, 2009

Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search.
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009

Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows.
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009

A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem.
Proceedings of the 9th International Conference on Hybrid Intelligent Systems (HIS 2009), 2009

Meta-heuristics for reconstructing cross cut shredded text documents.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009

A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Proceedings of the Computer Aided Systems Theory, 2009

Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics.
Proceedings of the Computer Aided Systems Theory, 2009

Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms.
Proceedings of the Computer Aided Systems Theory, 2009

2008
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization.
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem.
Proceedings of the Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008

Bringing order into the neighborhoods: relaxation guided variable neighborhood search.
J. Heuristics, 2008

Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem.
J. Heuristics, 2008

An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem.
Eur. J. Oper. Res., 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, 2008

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, 2008

Combining Forces to Reconstruct Strip Shredded Text Documents.
Proceedings of the Hybrid Metaheuristics, 5th International Workshop, 2008

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks.
Proceedings of the Hybrid Metaheuristics, 5th International Workshop, 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), 2008

Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Effective Neighborhood Structures for the Generalized Traveling Salesman Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2007
Models and algorithms for three-stage two-dimensional bin packing.
Eur. J. Oper. Res., 2007

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2007

Determining Orbital Elements of Extrasolar Planets by Evolution Strategies.
Proceedings of the Computer Aided Systems Theory, 2007

2006
Biased Mutation Operators for Subgraph-Selection Problems.
IEEE Trans. Evol. Comput., 2006

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks.
Proceedings of the Operations Research, 2006

A Unified View on Hybrid Metaheuristics.
Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006

Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

The Core Concept for the Multidimensional Knapsack Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

2005
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem.
Evol. Comput., 2005

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification.
Proceedings of the Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005

2004
Editorial.
J. Math. Model. Algorithms, 2004

An improved hybrid genetic algorithm for the generalized assignment problem.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing.
Proceedings of the Parallel Problem Solving from Nature, 2004

An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem.
Proceedings of the Parallel Problem Solving from Nature, 2004

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.
Proceedings of the Genetic and Evolutionary Computation, 2004

Solving a Real-World Glass Cutting Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2004

2003
Edge sets: an effective evolutionary coding of spanning trees.
IEEE Trans. Evol. Comput., 2003

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs.
J. Heuristics, 2003

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

2002
Evolutionary local search for the edge-biconnectivity augmentation problem.
Inf. Process. Lett., 2002

Evolutionary computation and optimization track: SAC 2002.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

On Weight-Biased Mutation for Graph Problems.
Proceedings of the Parallel Problem Solving from Nature, 2002

A Memetic Algorithm for Vertex-Biconnectivity Augmentation.
Proceedings of the Applications of Evolutionary Computing, 2002

2001
Evolutionary computation and optimization track.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

Weight-biased edge-crossover in evolutionary algorithms for wto graph problems.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem.
Proceedings of the Applications of Evolutionary Computing, 2001

2000
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.
Proceedings of the Applied Computing 2000, 2000

A Hybrid GA for the Edge-Biconnectivity Augmentation Problem.
Proceedings of the Parallel Problem Solving from Nature, 2000

The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '00), 2000

1999
A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem.
Proceedings of the 1999 ACM Symposium on Applied Computing, 1999

Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem.
Proceedings of the Artificial Evolution, 4th European Conference, 1999

1998
Genetic Algorithms for the Multiple Container Packing Problem.
Proceedings of the Parallel Problem Solving from Nature, 1998

Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks.
Proceedings of the International ICSC / IFAC Symposium on Neural Computation (NC 1998), 1998

Transforming an analytically defined color space to match psychophysically gained color distances.
Proceedings of the Color Imaging: Device-Independent Color, 1998

1996
Skillful Genotype Decoding in EAs for Solving the Cutting Problem.
Proceedings of the Fifth Annual Conference on Evolutionary Programming, 1996


  Loading...