In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate that by considering the multi-objective versions of three basic optimization problems: spanning tree, matroid basis and matching in bipartite graphs. Here, besides the standard weight function, we are given k length funct...

In practice, there are many problems which decision parameters are fuzzy numbers, and some kind of this problems are formulated as either possibilitic programming or multi-objective programming methods. In this paper, we consider a multi-objective programming problem with fuzzy data in constraints and introduce a new approach for solving these problems base on a combination of the multi-objecti...

A linearization technique is developed for multi-objective multi-quadratic 0-1 programming problems with linear and quadratic constraints to reduce it to multi-objective linear mixed 0-1 programming problems. The method proposed in this paper needs only O (kn) additional continuous variables where k is the number of quadratic constraints and n is the number of initial 0-1 variables.