Please use this identifier to cite or link to this item: http://hdl.handle.net/10174/4484

Title: A decomposition method for approximating Pareto frontier in Multiobjective Integer Linear Problems
Authors: Bushenkov, Vladimir
Fernandes, Manuela
Editors: Evtushenko, Yu. G.
Golikov, A .I.
Keywords: Multiobjective optimization
Integer Linear Programming
Pareto frontier
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.
URI: http://hdl.handle.net/10174/4484
ISBN: 978-5-91601-051-0
Type: article
Appears in Collections:CIMA - Artigos em Livros de Actas/Proceedings
MAT - Artigos em Livros de Actas/Proceedings

Files in This Item:

File Description SizeFormat
VBushenkovMFernandes.pdf229.41 kBAdobe PDFView/OpenRestrict Access. You can Request a copy!
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Dspace Dspace
DSpace Software, version 1.6.2 Copyright © 2002-2008 MIT and Hewlett-Packard - Feedback
UEvora B-On Curriculum DeGois