资 源 简 介
Moved to GitHub
The project can be found at https://github.com/UniTime/cpsolver
The constraint solver library contains a local search based framework that allows modeling of a problem using constraint programming primitives (variables, values, constraints).
The search is based on an iterative forward search algorithm. This algorithm is similar to local search methods; however, in contrast to classical local search techniques, it operates over feasible, though not necessarily complete, solutions. In these solutions some variables may be left unassigned. All hard constraints on assigned variables must be satisfied however. Such solutions are easier to visualize and more meaningful to human users than complete but infeasible solutions. Because of the iterative character of the algorithm, the solver can also easily start, stop, or continue from any feasible solution, either complete or incomplete.
The framework also supports dynamic aspects of
文 件 列 表
doc
net
resources
src-html
allclasses-frame.html
allclasses-noframe.html
constant-values.html
deprecated-list.html
help-doc.html
index-all.html
index.html
overview-frame.html
overview-summary.html
overview-tree.html
package-list
serialized-form.html
stylesheet.css
src
net
bin
coursett-1.2.jar
cpsolver-all-1.2.jar
examtt-1.2.jar
ifs-1.2.jar
studentsct-1.2.jar
lib
dom4j-1.6.1.jar
log4j-1.2.8.jar
lgpl.txt
