A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

@article{Padberg1991ABA,
  title={A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems},
  author={Manfred W. Padberg and Giovanni Rinaldi},
  journal={SIAM Rev.},
  year={1991},
  volume={33},
  pages={60-100}
}
An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a “polyhedral” cutting-plane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the incidence vectors of the hamiltonian cycles of a complete graph. The cuts are generated by several identification procedures that have been described in a companion paper. Whenever the cutting-plane procedure does… 
A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
Several branch-and-bound algorithms for the exact solution of the asymmetric traveling salesman problem ATSP, based on the assignment problem AP relaxation, have been proposed in the literature.
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
We consider a variant of the classical symmetric Traveling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
TLDR
A wide variety of cuts is introduced to tighten the linear programming (LP) relaxation of the original mixed-integer program and ever increasing lower bounds on the optimal solution are obtained by solving a series of relaxed problems that incorporate newly found valid inequalities.
A branch-and-cut algorithm for the equicut problem
TLDR
An algorithm for solving the equicut problem on complete graphs is described that exploits a subset of the linear inequalities defining the convex hull of the incidence vectors of the edge sets that define an equicut.
Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut
A branch-and-cut IP solver is developed for a class of structured 0/1 integer programs arising from a truck dispatching scheduling problem. This problem involves a special class of knapsack equality
Solving the Orienteering Problem through Branch-and-Cut
TLDR
A branch-and-cut algorithm for finding an optimal OP solution, based on several families of valid inequalities, is described and proved to be able to solve to optimality large-scale instances involving up to 500 nodes, within acceptable computing time.
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)
TLDR
This study describes methods for implementing separation algorithms for domino-parity inequalities for symmetric traveling salesman problem and reports computational results showing the strength of the new routines, including the optimal solution of a 33,810-city instance from the TSPLIB.
Facet identification for the symmetric traveling salesman polytope
TLDR
Exact and heuristic shrinking conditions for the input graph are given that yield efficient procedures for the identification of simple and general comb inequalities and of some elementary clique tree inequalities.
A cutting plane algorithm for the unrelated parallel machine scheduling problem
TLDR
Computational results show that the proposed exact algorithm gives an optimal solution for almost all tested cases, within the fixed time and memory limits.
Exact solution of large-scale, asymmetric traveling salesman problems
TLDR
A lowest-first, branch-and-bound algorithm for the Asymmetric Traveling Salesman Problem based on the Assignment Problem relaxation and on a tour elimination branching scheme that solves real-world problems with up to 443 movements in less than 6 seconds.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Facet identification for the symmetric traveling salesman polytope
TLDR
Exact and heuristic shrinking conditions for the input graph are given that yield efficient procedures for the identification of simple and general comb inequalities and of some elementary clique tree inequalities.
A branch-and-cut approach to a traveling salesman problem with side constraints
TLDR
A software system AIAA/SOLVER is described that is implemented to solve the problem to optimality under an apparently weak assumption about its stochastic cost structure using branch-and-cut.
The Traveling-Salesman Problem and Minimum Spanning Trees
TLDR
It is shown that maxπwπ = C* precisely when a certain well-known linear program has an optimal solution in integers.
Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
A highly efficient algorithm (HK) devised by Held and Karp for solving the symmetric traveling-salesman problem was presented at the 7th Mathematical Programming Symposium in 1970 and published in
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
We report the solution to optimality of ten large-scale symmetric travelling salesman problems. The travelling salesman problem (TSP) is one of the standard problems of the Operations
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
TLDR
A new class of inequalities clique tree inequalities valid for the travelling salesman polytope is defined which properly contains many of the known classes of inequalities like subtour elimination constraints, 2-matching constraints, comb inequalities, and it is shown that all these new inequalities induce facets of the Traveller's salesmanpolytope.
The traveling-salesman problem and minimum spanning trees: Part II
TLDR
An efficient iterative method for approximating this bound closely from below is presented, and a branch-and-bound procedure based upon these considerations has easily produced proven optimum solutions to all traveling-salesman problems presented to it.
Solution of large-scale symmetric travelling salesman problems
TLDR
The implementation is based on a fast LP-solver (IBM's MPSX) and makes effective use of polyhedral results on the symmetric travelling salesman polytope and describes the important ingredients of the code.
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a general
On the symmetric travelling salesman problem: Solution of a 120-city problem
TLDR
It is reported how the shortest roundtrip through 120 German cities was found using a commercial linear programming code and adding facetial cutting planes in an interactive way.
...
1
2
3
4
5
...