Abstract
This chapter focuses on the type of recursive modeling that is required for solution by decision diagrams. It presents a formal development that highlights how solution by decision diagrams differs from traditional enumeration of the state space. It illustrates the versatility of recursive modeling with examples: single facility scheduling, scheduling with sequence-dependent setup times, and minimum bandwidth problems. It shows how to represent state-dependent costs with canonical arc costs in a decision diagram, a technique that can sometimes greatly simplify the recursion, as illustrated by a textbook inventory management problem. It concludes with an extension to nonserial recursive modeling and nonserial decision diagrams.
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). Recursive Modeling. In: Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-319-42849-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-42849-9_8
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)