For models involving list variables, new moves have been introduced to better manage constraints based on
partitionexpressions. These moves are particularly effective on routing and scheduling problems.
For near-linear (discrete or continuous) problems, new moves have been introduced based on linear programming and mixed-integer linear programming techniques. These moves allow to intensify the search on near-linear models by exploring optimally larger neighborhoods.