Abstract
Heuristic search techniques are known for their efficiency and effectiveness in solving NP-hard problems. In this chapter, we present a heuristic search framework allowing the synthesis and evaluation of a variety of algorithms and also a library of oneway constraints for problem modelling. The integration of the two is explained in the context of the iOpt toolkit. iOpt is a large software system comprising several libraries and frameworks dedicated to the development of combinatorial optimization applications based on heuristic search.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Voudouris, C., Dorne, R. (2003). Integrating Heuristic Search and One-Way Constraints in the Iopt Toolkit. In: Voß, S., Woodruff, D.L. (eds) Optimization Software Class Libraries. Operations Research/Computer Science Interfaces Series, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-306-48126-X_6
Download citation
DOI: https://doi.org/10.1007/0-306-48126-X_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7002-0
Online ISBN: 978-0-306-48126-0
eBook Packages: Springer Book Archive