ExamplesJaCoP
Class LeastDiff

java.lang.Object
  ExamplesJaCoP.Example
      ExamplesJaCoP.LeastDiff

public class LeastDiff
extends Example

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/

Author:

Hakan Kjellerstrand and Radoslaw Szymanek

Field Summary

Fields inherited from class ExamplesJaCoP.Example

cost, search, store, vars

Constructor Summary

LeastDiff()

Method Summary

static void	main(java.lang.String[] args) It executes the program which solves this simple optimization problem.
void	model() It specifies a standard way of modeling the problem.

Methods inherited from class ExamplesJaCoP.Example

creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

LeastDiff

public LeastDiff()

Method Detail

model

public void model()

Description copied from class: Example

It specifies a standard way of modeling the problem.

Specified by:

model in class Example

main

public static void main(java.lang.String[] args)

It executes the program which solves this simple optimization problem.

Parameters:

args -