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

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 ...

modern mathematics. Integer Programming with Quadratic Constraints 223 The final step in the solution to Hilbert's problem was taken by MATIJASEVIC[21 who built on earlier results of DAVIS, PUTNAM, ...