Abstract
This chapter presents two practical approaches to solving problems using NCL: relaxation and decomposition.
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
Preview
Unable to display preview. Download preview PDF.
References
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton: Princeton University Press (2006)
Hooker, J.N.: Logic, optimization, and constraint programming. INFORMS Journal on Computing, 14(4): 295–321 (2002)
Hoos, H.H., Stutzler, T.: Stochastic Local Search: Foundations and Applications, Morgan Kaufmann (2005)
Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. Proc. of IEEE International Conference on Tools with Artificial Intelligence, 13: 160–167 (2001)
Zhou, J.: Routing by mixed set programming. Proc. of the 8th International Symposium on Operations Research and Its Applications, 157–166 (2009)
Rights and permissions
Copyright information
© 2012 Science Press
About this chapter
Cite this chapter
Zhou, J. (2012). Relaxation and Decomposition. In: The NCL Natural Constraint Language. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23845-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-23845-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23844-4
Online ISBN: 978-3-642-23845-1
eBook Packages: Computer ScienceComputer Science (R0)