Solution of large-scale symmetric travelling salesman problems
From MaRDI portal
(Redirected from Publication:810369)
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Recommendations
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- On the solution of traveling salesman problems
- scientific article; zbMATH DE number 1947373
- Exact solution of large-scale, asymmetric traveling salesman problems
Cites work
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- scientific article; zbMATH DE number 3943560 (Why is no real title available?)
- scientific article; zbMATH DE number 4093179 (Why is no real title available?)
- scientific article; zbMATH DE number 3575371 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A cutting plane algorithm for minimum perfect 2-matchings
- A man-machine approach toward solving the traveling salesman problem
- A primal simplex variant for the maximum-flow problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An efficient algorithm for the minimum capacity cut problem
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- Facet identification for the symmetric traveling salesman polytope
- Geometric algorithms and combinatorial optimization
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- Maximum matching and a polyhedron with 0,1-vertices
- Multi-Terminal Network Flows
- Odd Minimum Cut-Sets and b-Matchings
- On the symmetric travelling salesman problem I: Inequalities
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Solving matching problems with linear programming
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The ellipsoid method and its consequences in combinatorial optimization
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(91)- Genetic local search in combinatorial optimization
- Some thoughts on combinatorial optimisation
- The use of dynamic programming in genetic algorithms for permutation problems
- A branch-and-cut algorithm for vehicle routing problems
- Chained Lin-Kernighan for large traveling salesman problems
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Separating maximally violated comb inequalities in planar graphs
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- Deep clustering of the traveling salesman problem to parallelize its solution
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope
- Computing compatible tours for the symmetric traveling salesman problem
- Point-to-point and multi-goal path planning for industrial robots
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- Solving a semidefinite relaxation of the traveling salesman problem.
- Solving the max-cut problem using eigenvalues
- Combinatorial algorithms in concorde
- Optimal partitioning of a data set based on the \(p\)-median model
- Improved filtering for weighted circuit constraints
- An optimality cut for mixed integer linear programs
- A cutting plane procedure for the travelling salesman problem on road networks
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
- On the polytope faces of the graph approximation problem
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- scientific article; zbMATH DE number 56359 (Why is no real title available?)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- Strong IP formulations need large coefficients
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Solving the family traveling salesman problem
- Tabu search performance on the symmetric travelling salesman problem
- Provably good solutions for the traveling salesman problem
- Online capacity planning for rehabilitation treatments: an approximate dynamic programming approach
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- An improved column generation algorithm for minimum sum-of-squares clustering
- Vehicle routing with stochastic demands and restricted failures
- Improved large-step Markov chain variants for the symmetric TSP
- A heuristic for the pickup and delivery traveling salesman problem
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Relaxed tours and path ejections for the traveling salesman problem
- scientific article; zbMATH DE number 1947373 (Why is no real title available?)
- Polyhedral techniques in combinatorial optimization I: Theory
- The dragon war
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- Affinity propagation and uncapacitated facility location problems
- Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors
- Certification of an optimal TSP tour through 85,900 cities
- Branch-and-cut approach to a variant of the traveling salesman problem
- On the solution of the traveling salesman problem once again
- Symmetric travelling salesman problem. Some new algorithmic possibilities
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
- A hybrid approach for biobjective optimization
- scientific article; zbMATH DE number 1342125 (Why is no real title available?)
- Ordered spatial sampling by means of the traveling salesman problem
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
- A learning based algorithm for drone routing
- Ideal polytopes and face structures of some combinatorial optimization problems
- Deriving compact extended formulations via LP-based separation techniques
- Travelling on graphs with small highway dimension
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem
- A revisited branch-and-cut algorithm for large-scale orienteering problems
- Routing problems: A bibliography
- State partitioning based linear program for stochastic dynamic programs: an invariance property
- An efficient quantum algorithm for the traveling salesman problem
- Travelling salesman problem tools for microcomputers
- Record breaking optimization results using the ruin and recreate principle
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Branch and cut methods for network optimization
- The affine hull of the schedule polytope for servicing identical requests by parallel devices
- Solution of a Large-Scale Traveling-Salesman Problem
- scientific article; zbMATH DE number 4093179 (Why is no real title available?)
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Lexicographic local search and the \(p\)-center problem.
- An approximation algorithm for the (metric) clustered path traveling salesman problem
- Computing in combinatorial optimization
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- On facet-inducing inequalities for combinatorial polytopes
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An approximation algorithm for the clustered path travelling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem
- Implementation of ensemble-based simulated annealing with dynamic load balancing under MPI
- Survey of facial results for the traveling salesman polytope
- Packing Steiner trees: A cutting plane algorithm and computational results
- Deriving compact extended formulations via LP-based separation techniques
- A cutting plane algorithm for the windy postman problem
- The solution of some 100-city travelling salesman problems
- Exploiting planarity in separation routines for the symmetric traveling salesman problem
- Problems of discrete optimization: challenges and main approaches to solve them
This page was built for publication: Solution of large-scale symmetric travelling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810369)
