Pages that link to "Item:Q4015422"
From MaRDI portal
The following pages link to TSPLIB—A Traveling Salesman Problem Library (Q4015422):
Displaying 50 items.
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- The neighbor-net algorithm (Q550258) (← links)
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions (Q609175) (← links)
- Evolutionary self-adaptation: a survey of operators and strategy parameters (Q613015) (← links)
- A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Variable neighborhood search for harmonic means clustering (Q636511) (← links)
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Improving genetic algorithm with fine-tuned crossover and scaled architecture (Q670576) (← links)
- Solving combinatorial optimization problems using augmented Lagrange chaotic simulated annealing (Q691303) (← links)
- Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- Solving the family traveling salesman problem (Q723922) (← links)
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
- Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
- A hyperbolic smoothing approach to the multisource Weber problem (Q740639) (← links)
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
- Parallelization strategies for rollout algorithms (Q812417) (← links)
- Performance analysis of cyclical simulated annealing algorithms (Q812974) (← links)
- Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm (Q847836) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Application of the cross-entropy method to clustering and vector quantization (Q868638) (← links)
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
- An approximation algorithm for network design problems with downwards-monotone demand functions (Q928296) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- Design of hybrids for the minimum sum-of-squares clustering problem (Q951921) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem (Q954938) (← links)
- A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
- The effective application of a new approach to the generalized orienteering problem (Q972648) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (Q976011) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
