The following pages link to Dennis Weyland (Q336340):
Displayed 8 items.
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- Analysis of evolutionary algorithms for the longest common subsequence problem (Q848642) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
- Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines (Q3167642) (← links)
- The Computational Complexity of Stochastic Optimization (Q3195326) (← links)
- An Enhanced Ant Colony System for the Sequential Ordering Problem (Q5176328) (← links)