Add to ORKGThe two phase method is a well-known method to find Pareto optimal solutions to biobjective combinatorial optimization problems [Ulungu and Teghem, 95]. We adapt this method to Lorenz dominance, a model proposed in economics to refine Pareto dominance by focusing on well-balanced solutions. This adaptation amounts to computing the solutions that optimize an OWA aggregator [Yager, 98] in a first phase, and all the remaining Lorenz optimal solutions in a second phase. We present the results obtained for different biobjective combinatorial optimization problems.nonouirechercheInternationa
In this paper, we present several algorithms for the bi-objective assignment problem. The algorithms...
In this paper we present a synthesis of the two phase method for the biobjective assignment problem....
Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are be...
LNCS n°9346This paper deals with biobjective combinatorial optimization problems where both objectiv...
International audienceThe set of Pareto nondominated solutions obtained in some practical ...
This paper deals with fair optimization problems where sev-eral agents are involved. In this setting...
Many concrete and important problems can be formulated by a mixed-integer linear programme. For thos...
Bi-objective combinatorial optimization (BOCO) deals with mathematical programming models where two ...
Many real-world applications of multi-objective optimization involve a large number of objectives. A...
We study a variant of the two-phase method for general bi-objective combinatorial optimization probl...
Powerpoint presentationBioinspired computation methods, such as evolutionary algorithms and ant colo...
Many real-world applications of multi-objective optimization involve a large number of objectives. A...
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three m...
When applied to multiobjective combinatorial optimization problems defined in terms of Pareto optima...
none3mixedChen, Bo; Gritzmann, Peter; Martello, SilvanoChen, Bo; Gritzmann, Peter; Martello, Silvan
In this paper, we present several algorithms for the bi-objective assignment problem. The algorithms...
In this paper we present a synthesis of the two phase method for the biobjective assignment problem....
Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are be...
LNCS n°9346This paper deals with biobjective combinatorial optimization problems where both objectiv...
International audienceThe set of Pareto nondominated solutions obtained in some practical ...
This paper deals with fair optimization problems where sev-eral agents are involved. In this setting...
Many concrete and important problems can be formulated by a mixed-integer linear programme. For thos...
Bi-objective combinatorial optimization (BOCO) deals with mathematical programming models where two ...
Many real-world applications of multi-objective optimization involve a large number of objectives. A...
We study a variant of the two-phase method for general bi-objective combinatorial optimization probl...
Powerpoint presentationBioinspired computation methods, such as evolutionary algorithms and ant colo...
Many real-world applications of multi-objective optimization involve a large number of objectives. A...
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three m...
When applied to multiobjective combinatorial optimization problems defined in terms of Pareto optima...
none3mixedChen, Bo; Gritzmann, Peter; Martello, SilvanoChen, Bo; Gritzmann, Peter; Martello, Silvan
In this paper, we present several algorithms for the bi-objective assignment problem. The algorithms...
In this paper we present a synthesis of the two phase method for the biobjective assignment problem....
Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are be...