Embedding relaxations in global constraints for solving TSP and TSPTW
From MaRDI portal
(Redirected from Publication:1601928)
Recommendations
Cited in
(14)- scientific article; zbMATH DE number 2080307 (Why is no real title available?)
- The salesman and the tree: the importance of search in CP
- Constraint relaxation for the discrete ordered median problem
- Constraint programming and operations research
- Approximation algorithms for the traveling repairman and speeding deliveryman problems
- Improved filtering for weighted circuit constraints
- scientific article; zbMATH DE number 2159468 (Why is no real title available?)
- Global strategies for augmenting the efficiency of TSP heuristics
- An ant colony system approach for variants of the traveling salesman problem with time windows
- TSPTW
- A global constraint for total weighted completion time for unary resources
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
- Semidefinite programming and constraint programming
- Adaptive CP-based Lagrangian relaxation for TSP solving
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)