Abstract
In this chapter we present a detailed study of MDD propagation for the sequence constraint. This constraint can be applied to combinatorial problems such as employee rostering and car manufacturing. It will serve to illustrate the main challenges when studying MDD propagation for a new constraint type: Tractability, design of the propagation algorithm, and practical efficiency. In particular, we show in this chapter that establishing MDD consistency for sequence is NP-hard, but fixed-parameter tractable. Furthermore, we present an MDD propagation algorithm that may not establish MDD consistency, but is highly effective in practice when compared to conventional domain propagation.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bergman, D., Cire, A.A., van Hoeve, WJ., Hooker, J. (2016). MDD Propagation for sequence Constraints. In: Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-319-42849-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-42849-9_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42847-5
Online ISBN: 978-3-319-42849-9
eBook Packages: Computer ScienceComputer Science (R0)