Theory of linear and integer programming
Theory of linear and integer programming
Clique tree inequalities and the symmetric travelling salesman problem
Mathematics of Operations Research
A new class of cutting planes for the symmetric travelling salesman problem
Mathematical Programming: Series A and B
An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
Facet identification for the symmetric traveling salesman polytope
Mathematical Programming: Series A and B
Solution of large-scale symmetric travelling salesman problems
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
The graphical relaxation: a new framework for the Symmetric Traveling Salesman Polytope
Mathematical Programming: Series A and B
Mathematics of Operations Research
Separating Maximally Violated Comb Inequalities in Planar Graphs
Mathematics of Operations Research
Separating a Superclass of Comb Inequalities in Planar Graphs
Mathematics of Operations Research
Finding Cuts in the TSP (A preliminary report)
Finding Cuts in the TSP (A preliminary report)
Take a walk and cluster genes: a TSP-based approach to optimal rearrangement clustering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Cut-and-solve: an iterative search strategy for combinatorial optimization problems
Artificial Intelligence
Rearrangement Clustering: Pitfalls, Remedies, and Applications
The Journal of Machine Learning Research
On the Exact Separation of Mixed Integer Knapsack Cuts
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Artificial Intelligence
Robust precoder adaptation for MIMO links with noisy limited feedback
IEEE Transactions on Information Theory
Improving linear programming approaches for the steiner tree problem
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
A basic toolbox for constrained quadratic 0/1 optimization
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Design and analysis of multi-user SDMA systems with noisy limited CSIT feedback
IEEE Transactions on Wireless Communications
A Branch and Cut solver for the maximum stable set problem
Journal of Combinatorial Optimization
ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
An exact algorithm for robust network design
INOC'11 Proceedings of the 5th international conference on Network optimization
Not every GTSP facet induces an STSP facet
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II
Lifting, tilting and fractional programming revisited
Operations Research Letters
Operations Research Letters
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
A transgenetic algorithm applied to the Traveling Car Renter Problem
Expert Systems with Applications: An International Journal
| Hi-index | 0.06 |
The first computer implementation of the Dantzig-Fulkerson-Johnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as cutting planes of Gomory's type. The practice of looking for and using cuts that match prescribed templates in conjunction with Gomory cuts was continued in computer codes of Miliotis, Land, and Fleischmann. Gr枚tschel, Padberg, and Hong advocated a different policy, where the template paradigm is the only source of cuts; furthermore, they argued for drawing the templates exclusively from the set of linear inequalities that induce facets of the TSP polytope. These policies were adopted in the work of Crowder and Padberg, in the work of Gr枚tschel and Holland, and in the work of Padberg and Rinaldi; their computer codes produced the most impressive computational TSP successes of the nineteen eighties. Eventually, the template paradigm became the standard frame of reference for cutting planes in the TSP. The purpose of this paper is to describe a technique for finding cuts that disdains all understanding of the TSP polytope and bashes on regardless of all prescribed templates. Combining this technique with the traditional template approach was a crucial step in our solutions of a 13,509-city TSP instance and a 15,112-city TSP instance.