Abstract
In recent years, an increasing number of researchers, from both the Operations Research (OR) and the Artificial Intelligence (AI) communities, have investigated the possibility of integrating methodologies of the two fields in order to obtain better results in solving combinatorial optimization problems. In this chapter we show how the SCLP paradigm could be useful to merge together AI and OR interests.
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.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bistarelli, S. (2004). 7. SCLP and Generalized Shortest Path Problems. In: Semirings for Soft Constraint Solving and Programming. Lecture Notes in Computer Science, vol 2962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25925-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-25925-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21181-5
Online ISBN: 978-3-540-25925-1
eBook Packages: Springer Book Archive