#### Filter Results:

#### Publication Year

2006

2014

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We present a fully polynomial time approximation scheme (FPTAS) for optimizing a very general class of non-linear functions of low rank over a polytope. Our approximation scheme relies on constructing an approximate Pareto-optimal front of the linear functions which constitute the given low-rank function. In contrast to existing results in the literature,… (More)

We present a three-dimensional offline path planner for Unmanned Aerial Vehicles (UAVs) using a multiobjective optimization procedure for simultaneous optimization of two conflicting goals: (i) minimization of the length of overall path and (ii) maxi-mization of the margin of safety from ground obstacles. This method is different from 1 existing… (More)

In this paper, we present a general framework for designing approximation schemes for combinatorial optimization problems in which the objective function is a combination of more than one function. Examples of such problems include those in which the objective function is a product or ratio of two linear functions, parallel machine scheduling problems with… (More)

— In this paper, we present a new paradigm of searching optimal strategies in the game of Iterated Prisoner's Dilemma using multiple objective evolutionary algorithms. This method is better than the existing approaches, because it not only gives strategies which perform better in the iterated game, but also gives a family of non-dominated strategies, which… (More)

We consider the problem of appointment scheduling in a robust optimization framework. The appointment scheduling problem arises in many service operations, for example health care. For each job, we are given its minimum and maximum possible execution times. The objective is to find an appointment schedule for which the cost in the worst case scenario of the… (More)

- ‹
- 1
- ›