The following pages link to TSPLIB (Q13727):
Displaying 50 items.
- 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)
- Path optimization with limited sensing ability (Q729301) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
- A hyperbolic smoothing approach to the multisource Weber problem (Q740639) (← links)
- Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
- Evolutionary algorithm to traveling salesman problems (Q745754) (← links)
- A method to compute the sparse graphs for traveling salesman problem based on frequency quadrilaterals (Q777307) (← 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)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem (Q846437) (← 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)
- A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← 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)
- The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic (Q869586) (← links)
- Multiprogramming genetic algorithm for optimization problems with permutation property (Q870194) (← links)
- Neural networks: computational models and applications. (Q870738) (← links)
- A lower bound for the breakpoint phylogeny problem (Q876716) (← links)
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms (Q887179) (← links)
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
- The multiple traveling salesmen problem with moving targets (Q895767) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← 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)
- Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems (Q936447) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- Path planning on a cuboid using genetic algorithms (Q942312) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← 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 hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
