Maria J. Blesa

Available identifiers

Publication	Date of Publication	Type
Maria Serna's contributions to adversarial queuing theory	2021-12-20	Paper
Firefighting as a Strategic Game	2021-03-26	Paper
Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?	2020-08-05	Paper
Celebrity games	2016-09-12	Paper
Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem	2016-04-21	Paper
Beam-ACO for the Repetition-Free Longest Common Subsequence Problem	2016-01-25	Paper
Firefighting as a Game	2015-09-09	Paper
The robustness of stability under link and node failures	2011-12-07	Paper
Beam search for the longest common subsequence problem	2009-08-14	Paper
An ant colony optimization algorithm for DNA sequencing by hybridization	2008-04-28	Paper
Finding edge-disjoint paths in networks: an ant colony optimization algorithm	2008-01-14	Paper
Probabilistic Beam Search for the Longest Common Subsequence Problem	2007-11-29	Paper
Distributed Computing	2006-11-01	Paper
New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem	2005-02-22	Paper
A Characterization of Universal Stability in the Adversarial Queuing Model	2005-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q4737359	2004-08-11	Paper

This page was built for person: Maria J. Blesa