Optimization problems as a research area encompass the theoretical and algorithmic study of selecting the best solution from a feasible set according to one or more objective functions, under possibly ...

The targets of this research are problem-solving mathematical models that can solve mathematically vague problems in the real world by formulating them as mathematical problems. Such mathematical ...

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