Pages that link to "Item:Q5284220"
From MaRDI portal
The following pages link to Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP (Q5284220):
Displaying 16 items.
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
- Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- POPMUSIC for the travelling salesman problem (Q1991147) (← links)
- Improving the robustness of EPS to solve the TSP (Q2170194) (← links)
- Fast and high precision algorithms for optimization in large-scale genomic problems (Q2490543) (← links)
- Iterated local search for consecutive block minimization (Q2668701) (← links)
- Using regression models to understand the impact of route-length variability in practical vehicle routing (Q2679006) (← links)
- A neural-network-based approach to the double traveling salesman problem. (Q2780866) (← links)
- The Travelling Salesman Problem for finite-sized cities (Q3061161) (← links)
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem (Q3643507) (← links)
- A PTAS for Euclidean TSP with Hyperplane Neighborhoods (Q4987459) (← links)
