TSPLIB

swMATH983MaRDI QIDQ13727FDOQ13727

Author name not available (Why is that?)

Described by source

• TSPLIB—A Traveling Salesman Problem Library

Cited In (only showing first 100 items - show all)

• Generating subtour elimination constraints for the TSP from pure integer solutions
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• A scatter search approach for the minimum sum-of-squares clustering problem
• Approximation algorithms for the bi-criteria weighted MAX-CUT problem
• Cuts for mixed 0-1 conic programming
• Solution bias in ant colony optimisation: Lessons for selecting pheromone models
• The generalized covering salesman problem
• Generating good starting solutions for the \(p\)-median problem in the plane
• Sequential search and its application to vehicle-routing problems
• Neural networks: computational models and applications.
• A review of Hopfield neural networks for solving mathematical programming problems
• Survivability in hierarchical telecommunications networks
• An improved approximation scheme for the Group Steiner Problem
• The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
• Two-stage nested partitions method for stochastic optimization
• Approximation Algorithms for the Black and White Traveling Salesman Problem
• Heuristiques pour le Problème du Vendeurm-Péripatétique
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
• Practical performance of efficient minimum cut algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate extended formulations
• hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
• An iterated local search heuristic for the split delivery vehicle routing problem
• Model-based automatic neighborhood design by unsupervised learning
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
• Local search heuristics for the mobile facility location problem
• New heuristic algorithms for solving the planar \(p\)-median problem
• Variable neighborhood search for the pharmacy duty scheduling problem
• Two level general variable neighborhood search for attractive traveling salesman problem
• Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
• Randomized heuristics for the family traveling salesperson problem
• A Multilevel Approach to the Travelling Salesman Problem
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• The delivery man problem with time windows
• Title not available (Why is that?)
• Experiments on the minimum linear arrangement problem
• Title not available (Why is that?)
• New local searches for solving the multi-source Weber problem
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
• Random tours in the traveling salesman problem: Analysis and application
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• An immune memory clonal algorithm for numerical and combinatorial optimization
• Comparing different metaheuristic approaches for the median path problem with bounded length
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• The pickup and delivery traveling salesman problem with first-in-first-out loading
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
• Combined location-routing problems -- a neural network approach
• Construction heuristics for the asymmetric TSP.
• A random-key genetic algorithm for the generalized traveling salesman problem
• Determining Whether a Problem Characteristic Affects Heuristic Performance
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Multi-depot multiple TSP: a polyhedral study and computational results
• Title not available (Why is that?)
• Locating median cycles in networks
• The time constrained maximal covering salesman problem
• Approximation schemes for NP-hard geometric optimization problems: a survey
• Algorithms and codes for dense assignment problems: The state of the art
• An integer programming-based local search for the covering salesman problem
• An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
• Data structures and ejection chains for solving large-scale traveling salesman problems
• Title not available (Why is that?)
• Tolerance-based branch and bound algorithms for the ATSP
• First vs. best improvement: an empirical study
• Chained Lin-Kernighan for large traveling salesman problems
• A new formulation and resolution method for the \(p\)-center problem
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• Modifications of the two-stage transportation problem and their applications
• Planar branch decompositions. I: The ratcatcher
• Planar branch decompositions. II: The cycle method
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• The balanced billing cycle vehicle routing problem
• Locating a cycle in a transportation or a telecommunications network
• Parallel metaheuristics: recent advances and new trends
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• The orienteering problem with variable profits
• Title not available (Why is that?)
• On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
• Robust optimization for routing problems on trees
• Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
• Efficient heuristics for Median Cycle Problems
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Experimental analysis of heuristics for the bottleneck traveling salesman problem
• A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems

This page was built for software: TSPLIB