The following pages link to (Q3500152):
Displaying 8 items.
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- Recent trends in metaheuristics for stochastic combinatorial optimization (Q692975) (← links)
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- On the finite-time dynamics of ant colony optimization (Q2433257) (← links)
- Local search for constrained graph clustering in biological networks (Q2668745) (← links)
- Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem (Q6070990) (← links)
