Package org.jacop.examples.fd
Class LeastDiff
java.lang.Object
org.jacop.examples.fd.ExampleFD
org.jacop.examples.fd.LeastDiff
Simple least Diff problem.
Minimize the difference ABCDE - FGHIJ where A..J is all different in the range 0..9.
The solution is: 50123 - 49876 = 247
JaCoP Model by Hakan Kjellerstrand (hakank@bonetmail.com) Also see http://www.hakank.org/JaCoP/
- Version:
- 4.8
-
Field Summary
-
Constructor Summary
Constructors -
Method Summary
Methods inherited from class org.jacop.examples.fd.ExampleFD
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
-
Constructor Details
-
LeastDiff
public LeastDiff()
-
-
Method Details