Pages that link to "Item:Q336343"
From MaRDI portal
The following pages link to Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343):
Displaying 9 items.
- A two-stage approach for task and resource management in multimedia cloud environment (Q259149) (← links)
- Adaptive scheduling algorithm for media-optimized traffic management in software defined networks (Q259154) (← links)
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) (← links)
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104) (← links)
- The probabilistic orienteering problem (Q1652250) (← links)
- A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations (Q2664431) (← links)
- Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines (Q3167642) (← links)
