public class LeastDiff extends ExampleFD
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/
Constructor and Description |
---|
LeastDiff() |
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] args)
It executes the program which solves this simple optimization problem.
|
void |
model()
It specifies a standard way of modeling the problem.
|
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
Copyright © 2022. All rights reserved.