Explore zero-one integer programming, a key method in logical problem-solving, using binary choices for optimal decisions in finance, production, and more.

Integer programming is a crucial branch of mathematical optimisation that focuses on problems where some or all decision variables are constrained to be integers. This field underpins many practical ...

Formulations of mathematical programs often require that some of the decision variables take only integer values. Consider the formulation You can follow the same steps to identify binary variables.

Methods for NP-hard discrete optimization problems, including general methods like branch-and-bound and cutting planes, as well as special purpose branch-and-cut methods. Students will be able to ...

The theory of equivalent integer programs is generalized so that a set of minimal canonical problems always exists within each equivalence class. An example is used to demonstrate how highly ...