> Languages and APIs > ILOG Concert Technology for Java Users > Controlling ILOG CPLEX Optimizers > Priority Orders and Branching Directions

When solving MIPs, another important way to control the solution process is by providing priority orders and branching directions for variables. The methods for doing so are:

Priority orders and branch directions allow you to control the branching performed during branch & cut in a static way.

Dynamic control of the solution process of MIPs is provided through goals or control callbacks. Goals are discussed for C++ in Using Goals. Control callbacks are discussed in Using Callbacks. (Java goals and callbacks are similar to the C++ versions.) Goals and callbacks allow you to control the solution process when solving MIPs based on information generated during the solution process itself. Goals and Callbacks: a Comparison contrasts the advantages of both.