## Uses of Interface
net.sf.cpsolver.ifs.model.LazyNeighbour.LazyNeighbourAcceptanceCriterion

- Packages that use LazyNeighbour.LazyNeighbourAcceptanceCriterion
  Package | Description
  --- | ---
  net.sf.cpsolver.exam.heuristics | Examination Timetabling: Solution Heuristics.
  net.sf.cpsolver.ifs.algorithms | IFS Neighbourhood Search Algorithms
  net.sf.cpsolver.ifs.model | IFS Model (description of a problem)

- - ### Uses of LazyNeighbour.LazyNeighbourAcceptanceCriterion in net.sf.cpsolver.exam.heuristics

    Classes in net.sf.cpsolver.exam.heuristics that implement LazyNeighbour.LazyNeighbourAcceptanceCriterion
    Modifier and Type | Class and Description
    --- | ---
    `class` | `ExamGreatDeluge` Greate deluge.
    `class` | `ExamHillClimbing` Hill climber.
    `class` | `ExamSimulatedAnnealing` Simulated annealing.

  - ### Uses of LazyNeighbour.LazyNeighbourAcceptanceCriterion in net.sf.cpsolver.ifs.algorithms

    Classes in net.sf.cpsolver.ifs.algorithms that implement LazyNeighbour.LazyNeighbourAcceptanceCriterion
    Modifier and Type | Class and Description
    --- | ---
    `class` | `GreatDeluge<V extends Variable<V,T>,T extends Value<V,T>>` Great deluge.
    `class` | `HillClimber<V extends Variable<V,T>,T extends Value<V,T>>` Hill climber.
    `class` | `NeighbourSearch<V extends Variable<V,T>,T extends Value<V,T>>` Base class for the search techniques like hill climber, great deluge, or simulated annealing.
    `class` | `SimulatedAnnealing<V extends Variable<V,T>,T extends Value<V,T>>` Simulated annealing.
    `class` | `StepCountingHillClimber<V extends Variable<V,T>,T extends Value<V,T>>` Step counting hill climber.

  - ### Uses of LazyNeighbour.LazyNeighbourAcceptanceCriterion in net.sf.cpsolver.ifs.model

    Methods in net.sf.cpsolver.ifs.model with parameters of type LazyNeighbour.LazyNeighbourAcceptanceCriterion
    Modifier and Type | Method and Description
    --- | ---
    `void` | LazyNeighbour.`setAcceptanceCriterion(LazyNeighbour.LazyNeighbourAcceptanceCriterion<V,T> criterion)` Set acceptance criterion (to be used by a search strategy before the neighbour is accepted, so that it can be undone if desired)