Comet™ uses hybrid optimization techniques to reduce development time and increase solution quality

Hybridizations between constraint programming, mathematical programming, and local search have created a new paradigm in the way that complex business problems are solved.  Comet™ gives you the ability to integrate these technologies in a unified framework to simplify the design and implementation of complex applications.  The technologies share the same search primitives, enabling deep integration and greater ease of use.  The end result is a powerful and flexible environment for developing solutions that create significant and lasting organizational value.

Key Hybrid Optimization Capabilities in Comet

• Native parallelism to speed time to solution
• Constraint-based column generation
• Constraint-based Benders decomposition
• Constraint-based branch and price
• Large neighborhood search