Author Info
Name
Affiliation
Papers
DENNIS WEYLAND
Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, IDSIA, Switzerland
17
Collaborators
Citations 
PageRank 
9
108
8.43
Referers 
Referees 
References 
218
278
230
Search Limit
100278
Title
Citations
PageRank
Year
A structured view on weighted counting with relations to counting, quantum computation and applications00.342020
A simulation study of an on-demand transportation system.00.342018
The Computational Complexity of Stochastic Optimization.00.342014
On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines.30.392014
An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU10.402013
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling60.472013
A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines30.392013
A Structured View on Weighted Counting with Relations to Quantum Computation and Applications.00.342013
An Enhanced Ant Colony System for the Probabilistic Traveling Salesman Problem.20.422012
Coupling ant colony systems with strong local searches.321.062012
Hardness results for the probabilistic traveling salesman problem with deadlines60.522012
An Enhanced Ant Colony System for the Sequential Ordering Problem.60.562011
Using statistical tests for improving state-of-the-art heuristics for the probabilistic traveling salesman problem with deadlines20.372011
A Rigorous Analysis of the Harmony Search Algorithm: How the Research Community can be Misled by a "Novel" Methodology241.042010
Analysis of evolutionary algorithms for the longest common subsequence problem90.532010
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem70.492009
Simulated annealing, its parameter settings and the longest common subsequence problem70.452008