Simulated annealing, its parameter settings and the longest common subsequence problem. - Dennis Weyland (GECCO, 2008)

New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem. - Dennis Weyland; Leonora Bianchi; Luca Maria Gambardella (EUROCAST, 2009)

Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. - Thomas Jansen 001; Dennis Weyland (Algorithmica, 2010)

A Rigorous Analysis of the Harmony Search Algorithm: How the Research Community can be Misled by a "Novel" Methodology. - Dennis Weyland (Int. J. Appl. Metaheuristic Comput., 2010)

Using Statistical Tests for Improving State-of-the-Art Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (EUROCAST (1), 2011)

An Enhanced Ant Colony System for the Sequential Ordering Problem. - Luca Maria Gambardella; Roberto Montemanni; Dennis Weyland (OR, 2011)

An Enhanced Ant Colony System for the Probabilistic Traveling Salesman Problem. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (BIONETICS, 2012)

Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (ISCO, 2012)

Coupling ant colony systems with strong local searches. - Luca Maria Gambardella; Roberto Montemanni; Dennis Weyland (Eur. J. Oper. Res., 2012)

An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (EUROCAST (1), 2013)

Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (Comput. Oper. Res., 2013)

A Structured View on Weighted Counting with Relations to Quantum Computation and Applications. - Cassio P. de Campos; Georgios Stamoulis; Dennis Weyland (Electron. Colloquium Comput. Complex., 2013)

A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines. - Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella (J. Parallel Distributed Comput., 2013)

The Computational Complexity of Stochastic Optimization. - Cassio Polpo de Campos; Georgios Stamoulis; Dennis Weyland (ISCO, 2014)

On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines. - Dennis Weyland (Theor. Comput. Sci., 2014)

Metaheuristics and Cloud Computing: A Case Study on the Probabilistic Traveling Salesman Problem with Deadlines. - Dennis Weyland (EUROCAST, 2015)

Some Comments on the Stochastic Eulerian Tour Problem. - Dennis Weyland (CoRR, 2015)

A simulation study of an on-demand transportation system. - Claudia Archetti; M. Grazia Speranza; Dennis Weyland (Int. Trans. Oper. Res., 2018)

The Full Event Interpretation: An Exclusive Tagging Algorithm for the Belle II Experiment. - Thomas Keck; Fernando Abudinén; Florian U. Bernlochner; R. Cheaib; Sam Cunliffe; Michael Feindt; Torben Ferber; Moritz Gelb; Jochen Gemmler; Pablo Goldenzweig; Martin Heck; Sophie Hollitt; et al. (Comput. Softw. Big Sci., 2019)

A structured view on weighted counting with relations to counting, quantum computation and applications. - Cassio P. de Campos; Georgios Stamoulis; Dennis Weyland (Inf. Comput., 2020)