Abstract
Over the last decades interest in constraint networks has been rapidly increasing. In particular many papers have been published which focus on efficiency of constraint satisfaction algorithms. Often the performance of these algorithms is tested on problems such as the n-queens problem or the generalized job shop scheduling problem. In this article the activity of efficient modelling for practical applications in terms of objects and constraints is discussed. Such a discussion requires descriptions of models which are sufficiently explicit in order to be open for critic. The core of this article is such an explicit model in the context of horticultural production planning.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
