branch-and-bound systematic enumeration with bounds for integer/mixed-integer programs

MaRDI QIDQ6826046FDO

Partitions the search space and prunes using relaxations; backbone of modern mip solvers.

Described by source

• An Automatic Method of Solving Discrete Programming Problems
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library

This page was built for algorithm: branch-and-bound systematic enumeration with bounds for integer/mixed-integer programs