Pages that link to "Item:Q707147"
From MaRDI portal
The following pages link to Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms (Q707147):
Displaying 22 items.
- Multiobjective optimization: when objectives exhibit non-uniform latencies (Q319133) (← links)
- The effects of a new selection operator on the performance of a genetic algorithm (Q544067) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem (Q933505) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) (← 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 solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands (Q1023176) (← 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)
- Solving the probabilistic TSP with ant colony optimization (Q1774631) (← links)
- On the probabilistic min spanning tree problem (Q1935723) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem (Q2432887) (← links)
- Aggregation for the probabilistic traveling salesman problem (Q2489311) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- Challenges and Advances in A Priori Routing (Q3564352) (← links)
- Vertex-Uncertainty in Graph-Problems (Q5505652) (← links)