constraint programming techniques

    <p class=default>
      
        A quite new field of research is also the hybridization of metaheuristics with other 
        techniques. Recently, it was observed that the incorporation of more classical artificial 
        intelligence and operations research techniques in metaheuristics can be very beneficial. 
        An example is the use of constraint programming techniques, such as domain filtering and 
        variable fixing, in order to shrink the search space that has to be searched by a 
        metaheuristic. Another example is the incorporation of tree search procedures in 
        metaheuristics.
      
    <br/>

      
        
      
    </p>