Integer programming, a cornerstone of combinatorial optimisation, focuses on the selection of discrete decision variables to solve complex real‐world problems such as scheduling, network design and ...

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.

A new efficient system of representing the decision-maker's preference structure in solving multicriteria integer programming problems is developed. The problem is solved by an interactive ...

This is a preview. Log in through your library . Abstract In an earlier paper [20] combinatorial programming procedures were presented for solving a class of integer programming problems in which all ...

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

Research areas: Healthcare optimization under uncertainty, Large-scale optimization, stochastic programming, decomposition-based integer programming algorithms (Benders decomposition, Lagrangian ...

Mathematical Background: We expect that the student is comfortable with basic mathematics at the level of a U.S. first-year college STEM student. This includes basic notions such as sets and functions ...