In this paper a practically efficient QoS routing method is presented, which provides a
solution to the delay constrained least cost routing problem. The algorithm uses the concept …

An introduction to ratio optimization problems is provided which covers various applications
as well as major theoretical and algorithmic developments. In addition to an extensive …

We review some recent developments in single-ratio and generalized fractional
programming. In the latter case we focus on the maximization of the smallest of several …

Single-ratio and multi-ratio fractional programs in applications are often generalized convex
programs. We begin with a survey of applications of single-ratio fractional programs, min …

Several major environmental issues like biodiversity loss and climate change currently
concern the international community. These topics that are related to the development of …

We present a family of knapsack problems (KPs) while highlighting their particular
applications. Though most of the problems are derived from the classical KP, the differences …

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three
major scientific domains: mathematics, theoretical computer science and management. The …

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 …

We consider the best subset selection problem in linear regression—that is, finding a
parsimonious subset of the regression variables that provides the best fit to the data …

This bibliography of fractional programming is a continuation of five previous bibliographies
by the author (Pure Appl. Math. Sci.(India), Vol. XIII, No. 1–2, 35–69, March (1981); ibid. Vol …