SBB

SBB is a GAMS solver for Mixed Integer Nonlinear Programming (MINLP) models. It is based on a combination of the standard Branch and Bound (B&B) method known from Mixed Integer Linear Programming and some of the standard NLP solvers already supported by GAMS. SBB can use all GAMS NLP solvers as subsolvers but it works best with NLP solvers that can utilize a near optimal point as a starting point like Conopt, Minos, and Snopt.SBB supports all types of discrete variables supported by GAMS, including Binary, Integer, Semicont, Semiint, Sos1, and Sos2.

Visit SBB

Type: Solver
Topic: Linear and integer programming
Audience: Researcher

More from GAMS

CONOPTSolverCONOPT is a feasible path solver based on advanced active set methods, particularly suited for large and sparse models.
GAMSModeling languageGAMS is a modeling system for mathematical optimization that lets users formulate complex problems in a high-level language and run them with different commercial and open-source solvers. All solvers are packaged in a single distribution, making it easy to switch between them and giving customers one point of contact for licensing and support. It also has a Python interface -GAMSPy- for building and solving mathematical optimization models using the GAMS technology stack. It keeps the modeling concepts of GAMS (sets, parameters, variables, equations) but exposes them as Python classes and functions. This allows modelers to stay in the Python ecosystem while using mature GAMS solvers and workflows.
GAMS use casesUse casesA selection of case studies that demonstrate the diverse application areas of mathematical optimization with GAMS.
PATHSolverThe PATH solver for MCP models is a Newton-based solver that combines a number of the most effective variations, extensions, and enhancements of this powerful technique.
PATHNLPSolverPATHNLP is a solver for large nonlinear programming problems that builds on the PATH algorithm, extending it from mixed complementarity problems to general NLPs. PATHNLP is distributed through the GAMS ecosystem.

SHOTSolverSHOT (Supporting Hyperplane Optimization Toolkit) is a deterministic solver for mixed-integer nonlinear programming problems (MINLPs). Originally, SHOT was intended for convex MINLP problems only, but now also has functionality to solve nonconvex MINLP problems as a heuristic method without providing any guarantees of global optimality. SHOT can solve certain nonconvex problem types to global optimality as well.
CPLEXSolverThe IBM ILOG CPLEX Optimizer solves integer programming problems, very large[3] linear programming problems using either primal or dual variants of the simplex method or the barrier interior point method, convex and non-convex quadratic programming problems, and convex quadratically constrained problems (solved via second-order cone programming, or SOCP).
Marco LübbeckeContent creatorProfessor of operations research at RWTH Aachen University.
Land-Doig CompetitionChallengeThe 2026 Land-Doig MIP Competition is a computational competition hosted by the 2026 Mixed Integer Programming Workshop, offering an opportunity for teams to showcase their practical and computational prowess and fostering innovation in computational MIP. It is named in honor of Ailsa H. Land and Alison G. Harcourt (née Doig), who proposed the first LP-based branch-and-bound algorithm.
Timo BertholdContent creatorMathematical Optimization Researcher, Teacher, and Manager
Discord: HiGHSCommunityThe HiGHS Discord server.

SBB

More from GAMS

Related resources