local-search-0.0.2: A first attempt at generalised local search within Haskell, for applications in combinatorial optimisation.

Index

basicExchangeControl.Search.Local.Neighbourhood, Control.Search.Local
exchangeControl.Search.Local.Neighbourhood, Control.Search.Local
firstChoiceControl.Search.Local.Navigator, Control.Search.Local
firstImprovControl.Search.Local
improvementControl.Search.Local.Transformation, Control.Search.Local
LSTree 
1 (Type/Class)Control.Search.Local.Tree, Control.Search.Local
2 (Data Constructor)Control.Search.Local.Tree, Control.Search.Local
mainControl.Search.Local.Example
manualNavigatorControl.Search.Local.Navigator, Control.Search.Local
maxFirstTabuControl.Search.Local
maxImprovControl.Search.Local
minFirstTabuControl.Search.Local
minImprovControl.Search.Local
mkTreeControl.Search.Local.Tree, Control.Search.Local
multiLevelApplyControl.Search.Local.Transformation, Control.Search.Local
nReverseControl.Search.Local.Transformation, Control.Search.Local
nShuffleControl.Search.Local.Transformation, Control.Search.Local
nSortControl.Search.Local.Transformation, Control.Search.Local
NumericallyPricedControl.Search.Local.Neighbourhood, Control.Search.Local
priceSolutionControl.Search.Local.Neighbourhood, Control.Search.Local
randomImprovControl.Search.Local
randomWalkControl.Search.Local
saTempControl.Search.Local
simpleTabuControl.Search.Local
sImprovementControl.Search.Local.Transformation, Control.Search.Local
simulatedAnnealingAControl.Search.Local
simulatedAnnealingBControl.Search.Local
stochasticTabuControl.Search.Local
tabuControl.Search.Local.Transformation, Control.Search.Local
thresholdWorseningControl.Search.Local.Transformation, Control.Search.Local
treeNodeChildrenControl.Search.Local.Tree, Control.Search.Local
treeNodeNameControl.Search.Local.Tree, Control.Search.Local
TSPTourControl.Search.Local.Example
varyingThresholdWorseningControl.Search.Local.Transformation, Control.Search.Local