Fractional 0-1 Programming: Complexity, Algorithms, Applications and Recent Advances

In this talk we consider a class of nonlinear integer optimization problems commonly known as fractional 0–1 programming problems (also, often referred to as hyperbolic 0–1 programming problems), where the objective is to optimize the sum of ratios of affine functions subject to a set of linear constraints. Such problems arise in diverse applications across different fields, and have been the subject of study in a number of papers during the past few decades. We overview the literature on fractional 0–1 programs including their applications, related computational complexity issues, and solution methods, with the focus on recent advances in the area. It is based on my recent survey paper (link below)