Pages that link to "Item:Q2901040"
From MaRDI portal
The following pages link to Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem (Q2901040):
Displaying 12 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)
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem (Q961563) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← 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)
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← 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)
- Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures (Q6109290) (← links)
