An additive bounding procedure for the asymmetric travelling salesman problem
Mathematical Programming: Series A and B
Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software (TOMS)
The k-cardinality assignment problem
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Efficient algorithms and codes for (italic)k(/italic)-cardinality assignment problems
Discrete Applied Mathematics
Depth-First Branch-and-Bound versus Local Search: A Case Study
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Reduced Cost-Based Ranking for Generating Promising Subproblems
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Hybrid Exact Algorithm for the TSPTW
INFORMS Journal on Computing
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Improved limited discrepancy search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
We model portions of the search tree via so-called search constraints. We focus on a particular kind of search constraint, the k-discrepancy constraint appearing in discrepancy-based search. The property that a node has an associated discrepancy k can be modeled (and enforced) through a linear constraint. Our key result is the exploitation of the k-discrepancy constraint to improve the bound given by any relaxation of a combinatorial optimization problem through the additive bounding technique (Fischetti and Toth 1989). We show how this simple idea can be effectively exploited to tighten relaxations in CP solvers and speed up the proof of optimality by performing a large variety of computational experiments on test problems involving the AllDifferent constraint. In this view, the additive bounding technique represents a non-trivial link between search and bound. Moreover, such a technique is general because it does not depend on either the AllDifferent constraint or the discrepancy search technique.