Embedding relaxations in global constraints for solving TSP and TSPTW
From MaRDI portal
Publication:1601928
DOI10.1023/A:1014492408220zbMath1002.68159OpenAlexW1542480886MaRDI QIDQ1601928
Filippo Focacci, Andrea Lodi, Michela Milano
Publication date: 27 June 2002
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014492408220
Related Items (10)
Constraint programming and operations research ⋮ The salesman and the tree: the importance of search in CP ⋮ Constraint relaxation for the discrete ordered median problem ⋮ Approximation algorithms for the traveling repairman and speeding deliveryman problems ⋮ A global constraint for total weighted completion time for unary resources ⋮ Unnamed Item ⋮ Improved filtering for weighted circuit constraints ⋮ Semidefinite Programming and Constraint Programming ⋮ TSPTW ⋮ An ant colony system approach for variants of the traveling salesman problem with time windows
Uses Software
This page was built for publication: Embedding relaxations in global constraints for solving TSP and TSPTW
