Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
From MaRDI portal
Cited in
(65)- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- An improved assignment lower bound for the Euclidean traveling salesman problem
- A cutting plane procedure for the travelling salesman problem on road networks
- The hierarchical network design problem
- Representability in mixed integer programming. I: Characterization results
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- A new class of cutting planes for the symmetric travelling salesman problem
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- Strong formulations for mixed integer programming: A survey
- Facets of the balanced (acyclic) induced subgraph polytope
- A cutting plane algorithm for a clustering problem
- Heuristics and their design: A survey
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- Euclidean semi-matchings of random samples
- The traveling salesman problem in graphs with some excluded minors
- The traveling salesman problem: An overview of exact and approximate algorithms
- Large-step Markov chains for the TSP incorporating local search heuristics
- The complexity of lifted inequalities for the knapsack problem
- Valid inequalities and facets of the capacitated plant location problem
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
- A technique for speeding up the solution of the Lagrangean dual
- Two-edge connected spanning subgraphs and polyhedra
- A branch-and-cut algorithm for vehicle routing problems
- A polyhedral approach to the rural postman problem
- Tabu search performance on the symmetric travelling salesman problem
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- Cutting-plane proofs in polynomial space
- A cutting plane algorithm for minimum perfect 2-matchings
- Facets and algorithms for capacitated lot sizing
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
- Combining simulated annealing with local search heuristics
- Computing in combinatorial optimization
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- Facets of the three-index assignment polytope
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- A partitioning column approach for solving LED sorter manipulator path planning problems
- Exact and inexact solution procedures for the order picking in an automated carousal conveyor
- Solving matching problems with linear programming
- A continuous linear optimization model for the exact solution of travelling-salesman-problems in connexion with expansion planning of ring networks
- On the vehicle routing problem
- Separating maximally violated comb inequalities in planar graphs
- Multi stage Monte Carlo optimization applied to a six hundred point travelling salesman problem
- Provably good solutions for the traveling salesman problem
- Polyhedral techniques in combinatorial optimization I: Theory
- scientific article; zbMATH DE number 1420487 (Why is no real title available?)
- Minimum-weight two-connected spanning networks
- An efficient procedure for the N-city traveling salesman problem
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
- A diagonal completion and 2-optimal procedure for the travelling salesman problem
- Classical cuts for mixed-integer programming and branch-and-cut
- Branch and cut methods for network optimization
- Rearrangement of DNA fragments: a branch-and-cut algorithm.
- Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
- Deep clustering of the traveling salesman problem to parallelize its solution
- Two-commodity opposite direction network flow formulations for the travelling salesman problem
- A successful algorithm for solving directed Hamiltonian path problems
- Solution of large-scale symmetric travelling salesman problems
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
- Facet identification for the symmetric traveling salesman polytope
- An efficient algorithm for the minimum capacity cut problem
This page was built for publication: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3888840)
