public class PigeonHole extends ExampleFD
The problem is how to assign n pigeons into n-1 holes in such a way that each hole holds only one pigeons. Clearly this problem is not satisfiable.
Modifier and Type | Field and Description |
---|---|
int |
noPigeons |
Constructor and Description |
---|
PigeonHole() |
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] args)
It executes the program to solve PigeonHole problem in two
different ways.
|
void |
model()
It specifies a standard way of modeling the problem.
|
void |
modelBasic()
It specifies inefficient model which uses only
primitive constraints.
|
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
public void model()
ExampleFD
public void modelBasic()
public static void main(String[] args)
args
- the number of pigeons.Copyright © 2022. All rights reserved.