Please use this identifier to cite or link to this item:
|Title: ||A decomposition method for approximating Pareto frontier in Multiobjective Integer Linear Problems|
|Authors: ||Bushenkov, Vladimir|
|Editors: ||Evtushenko, Yu. G.|
Golikov, A .I.
|Keywords: ||Multiobjective optimization|
Integer Linear Programming
|Issue Date: ||25-Sep-2011|
|Publisher: ||CCRAS, Moscow, Russia|
|Citation: ||Vladimir Bushenkov, Manuela Fernandes. A decomposition method for approximating Pareto frontier in Multiobjective Integer Linear Problems. In Proceedings of II International conference "Optimization and applications" (OPTIMA-2011), Petrovac, Montenegro, CCRAS, Moscow, 2011, pag 40-43.|
|Abstract: ||A new iterative method that approximates the
Pareto frontier in MOILP by pairs of interior and exterior estimates which converge each other during the iterations. These estimates are obtained by combining Convex Edgeworth-Pareto Hulls constructed for a number
of subsets into which the original Feasible Criteria Set is decomposed.|
|Appears in Collections:||CIMA - Artigos em Livros de Actas/Proceedings|
MAT - Artigos em Livros de Actas/Proceedings
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.