Mixed-Integer Programming

Large-scale mixed-integer problems are handled by several packages. The high-end products TOMLAB /GUROBI and TOMLAB /CPLEX implements branch- and cut search algorithms, that includes the latest research on cut- and presolve techniques. The packages includes both barrier and simplex based solver options. For problems in the order of a thousand unknowns, and less time requirements, there are two solvers implementing branch- and bound algorithms: miqpBB in TOMLAB /MINLP and mipSolve in the TOMLAB Base Module. mipSolve should be combined with MINOS for maximum efficiency.