Abstract
So far, this book has presented several techniques for modeling constraint satisfaction, dynamic programming, and planning problems. This chapter presents encodings for the Traveling Salesman Problem, comparing models for several solvers, including CP, SAT, MIP, and tabled planning.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
- 3.
A variable is called an attributed variable if one or more attributes are attached to it. A domain variable is a special kind of an attributed variable .
- 4.
The option label is supported in Picat version 1.4 and later.
- 5.
In Picat version 1.3, the mip module only supports linear constraints.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Zhou, NF., Kjellerstrand, H., Fruhman, J. (2015). Encodings for the Traveling Salesman Problem. In: Constraint Solving and Planning with Picat. SpringerBriefs in Intelligent Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-25883-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-25883-6_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25881-2
Online ISBN: 978-3-319-25883-6
eBook Packages: Computer ScienceComputer Science (R0)