Create divide and conquer, dynamic programming, and greedy algorithms. Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems.

Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

Integer programming and combinatorial optimization form the backbone of many decision-making and resource allocation problems across diverse fields, from logistics and telecommunications to ...

Integer programming is a crucial branch of mathematical optimisation that focuses on problems where some or all decision variables are constrained to be integers. This field underpins many ...

The 21st Conference on Integer Programming and Combinatorial Optimization June 8-10, 2020, London, UK.

A unifying framework is developed to facilitate the understanding of most known computational approaches to integer programming. A number of currently operational algorithms are related to this ...

The following is a simple mixed integer programming problem. Details can be found in Example 3.8 in the "Examples" section.

Andris A. Zoltners, Prabhakant Sinha, Integer Programming Models for Sales Resource Allocation, Management Science, Vol. 26, No. 3 (Mar., 1980), pp. 242-260 ...