Different search procedures can be applied to different submodels in order to construct solutions. This also makes it easier to detect infeasibilities within a model. Different search algorithms can be applied to various parts of the problem to be solved. Solve a problem and later modify it by expanding the domains of variables, adding and deleting constraints as well as adding or deleting variables. Local search Includes a framework for implementing local search.
Local search is based on stored solutions, moves, neighborhoods, and metaheuristics.
New trace mechanism Trace mechanism has been completely rewritten, simplifying debugging of constraint-programming applications. Inc. All rights reserved. Legal terms . Privacy policy .