TSPLIB
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A branch-and-price algorithm for the multi-source Weber problem
- The pickup and delivery traveling salesman problem with first-in-first-out loading
- Certification of an optimal TSP tour through 85,900 cities
- Minimizing the stabbing number of matchings, trees, and triangulations
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Tuning metaheuristics. A machine learning Perspective
- Combined location-routing problems -- a neural network approach
- Variable neighbourhood search: Methods and applications
- Exemplar-based clustering via simulated annealing
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- Speed-up techniques for solving large-scale biobjective TSP
- Computational study on planar dominating set problem
- A review of Hopfield neural networks for solving mathematical programming problems
- The attractive traveling salesman problem
- Heuristic algorithms for the multi-depot ring-star problem
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- Heuristics for the rural postman problem
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- On the solution of traveling salesman problems
- Genetic algorithms and traveling salesman problems
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions
- Linear programs for constraint satisfaction problems
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
- CAGE
- CDT
- Estimating the Held-Karp lower bound for the geometric TSP
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Exponential neighbourhood local search for the traveling salesman problem
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
- Solving the k-best traveling salesman problem
- GLOB
- iOpt
- LEDA
- MALLBA
- A fast optimization method based on a hierarchical strategy for the travelling salesman problem
- MADAM
- Packlib2
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
- emili
- ALNS
- QAPLIB
- pgRouting
- VeRoViz
- Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
- GeoPy
- HGS-CVRP
- SNDlib
- GRASP
- A bound for the symmetric travelling salesman problem through matroid formulation
- State-space search strategies gleaned from animal behavior: A traveling salesman experiment
- The TSP phase transition
- PERL
- Multistars, partial multistars and the capacitated vehicle routing problem
- Exponential irreducible neighborhoods for combinatorial optimization problems
- Transformations of generalized ATSP into ATSP.
- Approximation schemes for NP-hard geometric optimization problems: a survey
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Lexicographic local search and the \(p\)-center problem.
- GraphBase
- A bilevel programming approach to the travelling salesman problem.
- Two-stage nested partitions method for stochastic optimization
- A column generation approach to capacitated p-median problems
- ReCombinatorics
- BIANCA
- VLSI
- CF-GGA
- J-MEANS
- CHAC
- ABACUS
- A heuristic for the pickup and delivery traveling salesman problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Application of the noising method to the travelling salesman problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Heuristic procedures for the capacitated vehicle routing problem
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- A statistical analysis of simulated annealing applied to the p-median problem
- The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
- A new variant of a vehicle routing problem: Lower and upper bounds
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- Relaxed tours and path ejections for the traveling salesman problem
- Separating capacity constraints in the CVRP using tabu search
- Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
- Nagging: A scalable fault-tolerant paradigm for distributed search
- A matheuristic approach to the orienteering problem with service time dependent profits
- TTPLib
- SteinLib
- GALib
- A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem
- OGDF
- The time constrained maximal covering salesman problem
- OR-Library
- Visual attractiveness in routing problems: a review
- Making a state-of-the-art heuristic faster with data mining
- A parametric hybrid method for the traveling salesman problem
- GeoSteiner
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- An iterated local search for the traveling salesman problem with release dates and completion time minimization
- Intelligent-guided adaptive search for the maximum covering location problem
This page was built for software: TSPLIB
