Artikkelit, joihin on yleisen käytön mandaatti - Dennis WeylandLisätietoja
Ei saatavilla missään: 4
A rigorous analysis of the harmony search algorithm: How the research community can be misled by a “novel” methodology
D Weyland
International Journal of Applied Metaheuristic Computing (IJAMC) 1 (2), 50-60, 2010
Mandaatit: Swiss National Science Foundation
Hardness results for the probabilistic traveling salesman problem with deadlines
D Weyland, R Montemanni, LM Gambardella
International Symposium on Combinatorial Optimization, 392-403, 2012
Mandaatit: Swiss National Science Foundation
An improved heuristic for the probabilistic traveling salesman problem with deadlines based on GPGPU
D Weyland, R Montemanni, LM Gambardella
International Conference on Computer Aided Systems Theory, 332-339, 2013
Mandaatit: Swiss National Science Foundation
Metaheuristics and Cloud Computing: A Case Study on the Probabilistic Traveling Salesman Problem with Deadlines
D Weyland
International Conference on Computer Aided Systems Theory, 279-285, 2015
Mandaatit: Swiss National Science Foundation
Saatavilla jossain: 18
A critical analysis of the harmony search algorithm—How not to solve sudoku
D Weyland
Operations Research Perspectives 2, 97-105, 2015
Mandaatit: Swiss National Science Foundation
A simulation study of an on‐demand transportation system
C Archetti, MG Speranza, D Weyland
International Transactions in Operational Research 25 (4), 1137-1161, 2018
Mandaatit: Swiss National Science Foundation
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel monte carlo sampling
D Weyland, R Montemanni, LM Gambardella
Computers & operations research 40 (7), 1661-1670, 2013
Mandaatit: Swiss National Science Foundation
Analysis of evolutionary algorithms for the longest common subsequence problem
T Jansen, D Weyland
Proceedings of the 9th annual conference on Genetic and evolutionary …, 2007
Mandaatit: German Research Foundation
A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines
D Weyland, R Montemanni, LM Gambardella
Journal of Parallel and Distributed Computing 73 (1), 74-85, 2013
Mandaatit: Swiss National Science Foundation
On-demand public transportation
C Archetti, MG Speranza, D Weyland
Int. Trans. Oper. Res 14, 54-55, 2018
Mandaatit: Swiss National Science Foundation
New approximation-based local search algorithms for the probabilistic traveling salesman problem
D Weyland, L Bianchi, LM Gambardella
International Conference on Computer Aided Systems Theory, 681-688, 2009
Mandaatit: Swiss National Science Foundation
New heuristics for the probabilistic traveling salesman problem
D Weyland, L Bianchi, LM Gambardella
Proceedings of the VIII metaheuristic international conference (MIC 2009), 2009
Mandaatit: Swiss National Science Foundation
A structured view on weighted counting with relations to counting, quantum computation and applications
CP de Campos, G Stamoulis, D Weyland
Information and Computation 275, 104627, 2020
Mandaatit: Swiss National Science Foundation, Netherlands Organisation for Scientific …
A structured view on weighted counting with relations to quantum computation and applications
CP de Campos, G Stamoulis, D Weyland
Electronic Colloquium on Computational Complexity (ECCC) 20, 133, 2013
Mandaatit: Swiss National Science Foundation
An enhanced ant colony system for the probabilistic traveling salesman problem
D Weyland, R Montemanni, LM Gambardella
International Conference on Bio-Inspired Models of Network, Information, and …, 2012
Mandaatit: Swiss National Science Foundation
On the computational complexity of the probabilistic traveling salesman problem with deadlines
D Weyland
Theoretical Computer Science 540, 156-168, 2014
Mandaatit: Swiss National Science Foundation
Vehicle routing for exhausted oil collection
D Weyland, M Salani, R Montemanni, LM Gambardella
Journal of Traffic and Logistics Engineering 1 (1), 5-8, 2013
Mandaatit: Swiss National Science Foundation
Using statistical tests for improving state-of-the-art heuristics for the probabilistic traveling salesman problem with deadlines
D Weyland, R Montemanni, LM Gambardella
International Conference on Computer Aided Systems Theory, 448-455, 2011
Mandaatit: Swiss National Science Foundation
Convergence results for vehicle routing problems with stochastic demands
D Weyland, R Montemanni, LM Gambardella
International Conference on Operations Research and Statistics, 2011
Mandaatit: Swiss National Science Foundation
A Priori Optimization vs. Re-Optimization: A Comparison for Vehicle Routing
D Weyland, MG Speranza
Mandaatit: Swiss National Science Foundation
Tietokoneohjelma arvioi ja määrittää julkaisu- ja rahoitustiedot automaattisesti