miqpBB

The solver MIQP_bb solves large, sparse or dense mixed-integer linear and quadratic programming problems.

Main features

• MIQP_bb implements a branch-and-bound tree search algorithm. A new branching rule has been proposed which uses lower bounds to decide on the next fractional variable to branch upon. The new branching rule has been shown to improve convergence. The QP subproblems are solved using BQPD.
   
• MINLP_bb may use three different branching rule options, one being the above mentioned new rule.
   
• The dense and the sparse version of MIQP_bb are compiled in two different MEX binaries, making the two versions optimally efficient.
   
• MIQP_bb is integrated with the TOMLAB driver routines.
   
• MIQP_bb may be used as subproblem solver in the TOMLAB environment.