Combinatorial optimization and integer programming form the backbone of decision-making models in which discrete choices must be made under constraints. At its core, integer programming specialises in ...

The objective of the 3D-SCALO problem is to assign the given components to optimal mounting surfaces and position them at the best locations, while satisfying the requirements for (1) heat dissipation ...

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