TOMLAB OPTIMIZATION LOGO TOMLAB OPTIMIZATION AREA top banner
  # LOGIN   # REGISTER (FREE TRIAL)
  # myTOMLAB  
Products
*TOMLAB Base Module
*TOMLAB /MINOS
*TOMLAB /NPSOL
*TOMLAB /DNOPT
*TOMLAB /SNOPT
*TOMLAB /SOL
*TOMLAB /CGO
*TOMLAB /CPLEX
*TOMLAB /GUROBI
*TOMLAB /MINLP
 *Solvers
    bqpd
    filterSQP
    minlpBB
    miqpBB
*TOMLAB /MIPNLP
*TOMLAB /MISQP
*TOMLAB /PENSDP
*TOMLAB /PENBMI
*TOMLAB /KNITRO
*TOMLAB /OQNLP
*TOMLAB /CONOPT
*TOMLAB /PROPT
*TOMLAB /NLPQL
*TOMLAB /LGO
*TOMLAB /LGO-MINLP
*TOMLAB /GP
*TOMLAB /GENO
*TOMLAB /MAD
*TOMLAB /MIDACO

miqpBB

Download by creating a myTOMLAB account.

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

Main features

  • MIQPbb 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.
     
  • MINLPbb may use three different branching rule options, one being the above mentioned new rule.
     
  • The dense and the sparse version of MIQPbb are compiled in two different MEX binaries, making the two versions optimally efficient.
     
  • MIQPbb is integrated with the TOMLAB driver routines.
     
  • MIQPbb may be used as subproblem solver in the TOMLAB environment.
     

    Tomlab © 1989-2018. All rights reserved.    Last updated: May 24, 2018. Site map. Privacy Policy