scientific article; zbMATH DE number 795217
From MaRDI portal
Publication:4845366
Recommendations
Cited in
(only showing first 100 items - show all)- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- On common edges in optimal solutions to traveling salesman and other optimization problems
- A note on the traveling salesman problem
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- On the solution of traveling salesman problems
- Travelling salesman problem tools for microcomputers
- The traveling salesman problem: An overview of exact and approximate algorithms
- Optimal arcs for the traveling salesman problem
- Pyramidal traveling salesman problem
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- A computational study of smoothing heuristics for the 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
- A polyhedral approach to sequence alignment problems
- The traveling salesmanpProblem for lines in the plane
- The traveling salesman problem and its variations
- The multi-stripe travelling salesman problem
- Local search inequalities
- Distances between traveling salesman tours
- Combinatorial optimization and small polytopes
- TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
- Stronger K-tree relaxations for the vehicle routing problem
- Algorithms for solving the two-criterion large-scale travelling salesman problem
- The biobjective travelling purchaser problem
- An improved heuristic for the period traveling salesman problem
- Computational algorithms for the solution of the salesman problem. I: General pattern of classification
- The traveling salesman problem with backhauls
- An alternate formulation of the symmetric traveling salesman problem and its properties
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
- Worst-case analysis of a new heuristic for the travelling salesman problem
- Novel concave hull-based heuristic algorithm for TSP
- A cutoff time strategy based on the coupon collector's problem
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation
- On the facial structure of symmetric and graphical traveling salesman polyhedra
- A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Traveling salesman path problems
- New facets of the STS polytope generated from known facets of the ATS polytope
- Traveling salesman problem
- On cutwidth parameterized by vertex cover
- Developing a procedure to obtain knowledge of optimum solutions in a travelling salesman problem
- Fat computational complexity and heuristic design for the TSP
- Computing the cutwidth of bipartite permutation graphs in linear time
- The traveling salesman problem and its variations
- scientific article; zbMATH DE number 6011205 (Why is no real title available?)
- scientific article; zbMATH DE number 3847222 (Why is no real title available?)
- Aspects of the traveling salesman problem
- Travelling Salesman with a Self-Similar Itinerary
- The traveling salesman problem. A computational study.
- A noisy Euclidean traveling salesman problem: a computational analysis
- scientific article; zbMATH DE number 4149903 (Why is no real title available?)
- The traveling salesman problem: a linear programming formulation
- Tolerance-based Algorithms for the Traveling Salesman Problem
- A concise guide to the Traveling Salesman Problem
- Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3908167 (Why is no real title available?)
- scientific article; zbMATH DE number 3918121 (Why is no real title available?)
- scientific article; zbMATH DE number 3926663 (Why is no real title available?)
- Directed travelling salesman problem
- The hierarchical traveling salesman problem
- On Some Generalizations of the Travelling-Salesman Problem
- The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
- Generating Travelling-Salesman Problems with Known Optimal Tours
- A heuristic circulation-network approach to solve the multi-traveling salesman problem
- An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
- The Adult Training Centre Problem: A Case Study
- The n-line traveling salesman problem
- scientific article; zbMATH DE number 55971 (Why is no real title available?)
- Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce
- scientific article; zbMATH DE number 91020 (Why is no real title available?)
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- scientific article; zbMATH DE number 1051038 (Why is no real title available?)
- scientific article; zbMATH DE number 1947373 (Why is no real title available?)
- scientific article; zbMATH DE number 1975315 (Why is no real title available?)
- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
- scientific article; zbMATH DE number 2143861 (Why is no real title available?)
- Computing and Combinatorics
- The Traveling Salesman Problem with Distances One and Two
- On cutwidth parameterized by vertex cover
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- The moving-target traveling salesman problem
- Gale's Round-Trip Jeep Problem
- Traveling Salesperson Problems for the Dubins Vehicle
- On solving travelling salesman problem with vertex requisitions
- The traveling salesman problem: the spectral radius and the length of an optimal tour
- A variable neighborhood search algorithm for cost-balanced travelling salesman problem
- Separating clique tree and bipartition inequalities in polynomial time
- Optimal tour planning with specified nodes
- The traveling salesman problem: a deterministic algorithm using tabu search
- A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845366)
