This function creates and returns a node evaluator (an instance of IloNodeEvaluator) that implements a variation of Slice-Based Search in a Concert Technology model. (The function IloSBSEvaluator returns a node evaluator that implements Slice-Based Search.)

In this variation, discrepancies are confined to the top of the search tree. In the first pass, the goal manager explores nodes with all discrepancies (except width discrepancies) appears with a depth less than step. In the second pass, it does the same with a depth less than 2*step, and so on. This variation of slice-based search is more efficient if the search heuristic is very good (that is, if it makes mistakes only in the top of the search tree).

This function returns an instance of IloNodeEvaluator for use with the member functions IloSolver::startNewSearch and IloSolver::solve. An instance of IloSolver extracts the node evaluator that it returns as an instance of IlcNodeEvaluator for use during a Solver search.