Simple value ordering heuristic in frequency assignment problem

In this paper, we introduce one simple heuristic for value ordering in solving frequency assignment problem. Our approach is based on a special container to organize the values selection by jumping between two sides of domain. In order to reduce the time and space complexities of algorithm, we change the current value selection with last unchecked element in the domain, and put all the inconsistent values after it. Then domain is managed by the increasing of acceptable level of values. Different from static value ordering scheme, our approach is dynamically selection the values during the constraint propagation.