Subscribe to the newsletter

Newsletter archives :
01- 02 - 03 - 04 - 05

 

 

November 14th, 2008
Release of Xpress-Kalis 2008.3

Artelys and Dash Optimization (member of the Fair Isaac Corporation) announced today the issuing of the new software release of Xpress-Kalis 2008.3 Constraint Programming Module. One can find a ready-to-use practical module based on advanced added-value constraint programming techniques, which supplies an acknowledged achievement regarding both performance and flexibility with regard to discrete combinatorial problems. Xpress-Kalis is an excellent tool on the market designed for the resolving of scheduling and resource allocation matters.

Performance Improvement Resolving of Scheduling Issues

Thanks to a performance gain concerning scheduling issues, Xpress-Kalis is now able to process questions associated to very complex combinatorial aspects. The principal technical innovations are the following:

Possibility to choose between alternative resources,

Pre-emptive scheduling of tasks (with the possibility to interrupt tasks),

Possibility to use non-constant profiles of resources.

These innovations enable to obtain a substantially real representation of the true problems and significantly more accommodating modelling product.

Improvement of both Propagation and Research Algorithms

The Xpress-Kalis 2008.3 release has strongly upgraded its solver possibilities, and therefore has largely increased the software's generic performance:

Search tree: a big improvement in the ease of use thanks to the building-up search strategies by default,

An increased flexibility of specific strategies elaborated for advances users,

Providing the possibility to carry-out infeasibility analysis.

 

Back to news

 

 

 

NEWS

04.29.2010
Artelys Kalis upgrade announcement

04.27.2010
Artelys exhibits at two major industry fairs in Germany

03.23.2010
Try the new version of Artelys Kalis

 

 
   

HOME I NEWS I COMPANY I SERVICES I CAREERS I SITE MAP I CONTACT I FRANÇAIS

© Artelys SA 2000-2010, all rights reserved - Terms of use