Pages that link to "Item:Q976010"
From MaRDI portal
The following pages link to Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010):
Displaying 13 items.
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands (Q367631) (← links)
- Recent trends in metaheuristics for stochastic combinatorial optimization (Q692975) (← links)
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem (Q961563) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← 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)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- Putting continuous metaheuristics to work in binary search spaces (Q2012877) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
- Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem (Q2901040) (← links)
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem (Q3625007) (← links)
