Do you have a multi-core machine and a mixed- integer programming (MIP) problem that takes several nodes to solve?
Make the most of it— find out what the ILOG Parallel CPLEX MIP Optimizer can do for you!

The ILOG Parallel CPLEX MIP Optimizer takes advantage of multiple CPUs, or cores, to solve difficult optimization problems faster. It exploits parallelism while solving nodes of the branch-and-cut tree; and it implements a deterministic mode that produces a repeatable, invariant solution path, and an opportunistic mode that takes full advantage of parallelism for potentially better performance.

For a large suite of difficult MIP problems representing a wide range of industries and applications, ILOG's internal tests with ILOG CPLEX 11, using two threads, show that 70 percent of problems can benefit from ILOG Parallel CPLEX, with a median speedup of 1.7 and with 30 percent solving at least twice as fast. ILOG Parallel CPLEX achieved larger speedups with four threads.

The ILOG Parallel CPLEX MIP Optimizer makes it easy to use parallel optimization to solve your most difficult MIP problems. We are eager to show you what it can do for you.

See for yourself what ILOG Parallel CPLEX can do for you!
Enter your email address if you would like ILOG to benchmark Parallel CPLEX.