Fractional 0‐1 programming: applications and algorithms

Fractional 0‐1 programming: applications and algorithms

0.00 Avg rating0 Votes
Article ID: iaor20173615
Volume: 69
Issue: 1
Start Page Number: 255
End Page Number: 282
Publication Date: Sep 2017
Journal: Journal of Global Optimization
Authors: , ,
Keywords: programming: fractional, programming: nonlinear, programming: integer, heuristics
Abstract:

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. In this survey we overview the literature on fractional 0–1 programs including their applications, related computational complexity issues and solution methods including exact, approximation and heuristic algorithms.

Reviews

Required fields are marked *. Your email address will not be published.