The following pages link to TSPLIB (Q13727):
Displaying 50 items.
- 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)
- Attraction probabilities in variable neighborhood search (Q989828) (← links)
- Randomized gravitational emulation search algorithm for symmetric traveling salesman problem (Q990542) (← links)
- A branch-and-price algorithm for the multi-source Weber problem (Q1000170) (← links)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms (Q1008897) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- Tuning metaheuristics. A machine learning Perspective (Q1012715) (← links)
- Combined location-routing problems -- a neural network approach (Q1026597) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Exemplar-based clustering via simulated annealing (Q1036142) (← links)
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- A review of Hopfield neural networks for solving mathematical programming problems (Q1042039) (← links)
- The attractive traveling salesman problem (Q1043335) (← links)
- Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- Heuristics for the rural postman problem (Q1046717) (← links)
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
- On the solution of traveling salesman problems (Q1126862) (← links)
- Genetic algorithms and traveling salesman problems (Q1268132) (← links)
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem (Q1282966) (← links)
- Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
- An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
- Exponential neighbourhood local search for the traveling salesman problem (Q1302597) (← links)
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour (Q1302598) (← links)
- Solving the \(k\)-best traveling salesman problem (Q1302605) (← links)
- A fast optimization method based on a hierarchical strategy for the travelling salesman problem (Q1330340) (← links)
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← links)
- Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine (Q1351353) (← links)
- A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
- State-space search strategies gleaned from animal behavior: A traveling salesman experiment (Q1389208) (← links)
- The TSP phase transition (Q1391912) (← links)
- Multistars, partial multistars and the capacitated vehicle routing problem (Q1396812) (← links)
- Exponential irreducible neighborhoods for combinatorial optimization problems (Q1396916) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- Approximation schemes for NP-hard geometric optimization problems: a survey (Q1403283) (← links)
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (Q1403285) (← links)
- Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
- A bilevel programming approach to the travelling salesman problem. (Q1426728) (← links)
- Two-stage nested partitions method for stochastic optimization (Q1431343) (← links)
