Exact mixed-integer programming

In this thesis, we develop and implement an efficient algorithm that can exactly solve instances of the mixed-integer programming problem that are given by rational data. For a feasible instance, a truly optimal solution will be computed; for an infeasible instance, a provably correct infeasibility ... View More