Solving TSP through the Integration of OR and CP Techniques
- 31 March 1999
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 1, 13-25
- https://doi.org/10.1016/s1571-0653(04)00002-2
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A view of local search in constraint programmingPublished by Springer Nature ,1996
- The CLP( ℛ ) language and systemACM Transactions on Programming Languages and Systems, 1992
- Relaxation Lagrangienne: Le Probleme Du Knapsack 0–1†INFOR: Information Systems and Operational Research, 1983
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- Discrete-Variable Extremum ProblemsOperations Research, 1957