Embedding relaxations in global constraints for solving TSP and TSPTW

DOI10.1023/A:1014492408220zbMATH Open1002.68159OpenAlexW1542480886MaRDI QIDQ1601928FDOQ1601928

Authors: 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

Recommendations

• Solving TSP through the integration of OR and CP techniques
• Constraint programming and operations research
• scientific article; zbMATH DE number 2080307
• Improving the Held and Karp Approach with Constraint Programming
• scientific article; zbMATH DE number 2159468

zbMATH Keywords

constraint propagationrelaxationscost-based filtering

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (14)

• Title not available (Why is that?)
• Constraint relaxation for the discrete ordered median problem
• The salesman and the tree: the importance of search in CP
• Constraint programming and operations research
• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• Improved filtering for weighted circuit constraints
• Title not available (Why is that?)
• Global strategies for augmenting the efficiency of TSP heuristics
• An ant colony system approach for variants of the traveling salesman problem with time windows
• A global constraint for total weighted completion time for unary resources
• Title not available (Why is that?)
• TSPTW
• Semidefinite programming and constraint programming
• Adaptive CP-based Lagrangian relaxation for TSP solving

Uses Software

• CPLEX

This page was built for publication: Embedding relaxations in global constraints for solving TSP and TSPTW

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601928)