The paper reviews some of the major developments in fractional programming. The
emphasis is on applications and algorithms. Theoretical results are only outlined to the …

We review the recent progress in the design of efficient algorithms for various problems in
geometric optimization. We present several techniques used to attack these problems, such …

The density of a graph is the ratio of the number of edges to the number of vertices of the
graph. In this paper we will develop a fast algorithm for the fol-lowing problem: given an …

We consider an assortment optimization problem where a retailer chooses an assortment of
products that maximizes the profit subject to a capacity constraint. The demand is …

The classical maximum flow problem sometimes occurs in settings in which the arc
capacities are not fixed but are functions of a single parameter, and the goal is to find the …

In this paper, we study inverse optimization problems defined as follows. Let S denote the
set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 …

Davenport Schinzel sequences are sequences that do not contain forbidden alternating
subsequences of certain length. They are a powerful combinatorial tool applicable in …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

The goal of this paper is to point out that analyses of parallelism m computational problems
have practical implications even when mult~ processor machines are not available. This is …

Interplay between matrix theory and matroid theory is the main theme of this book, which
offers a matroid-theoretic approach to linear algebra and, reciprocally, a linear-algebraic …