### Dabeen Lee (이다빈), On a generalization of the Chvátal-Gomory closure

Room B232 IBS (기초과학연구원)Integer programming is the problem of optimizing a linear function over the set of integer solutions satisfying a system of inequalities. The most successful technique in practice is the so-called "cutting-plane" algorithm in combination with branch-and-bound enumeration. Cutting-planes for an integer linear program are linear inequalities that are valid for all integer feasible solutions but …