Volume 42, Number 3, July-September 2008
|Page(s)||371 - 387|
|Published online||20 August 2008|
Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
Departamento de Matemáticas Aplicadas, Facultad de
Ingeniería, Universidad Central de Venezuela, Caracas, Venezuela; email@example.com
2 Escuela de Computación, Facultad de Ciencias,Universidad Central de Venezuela, Apartado 47002, Caracas 1041-A, Venezuela; firstname.lastname@example.org
Accepted: 17 January 2008
An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.
Mathematics Subject Classification: 90C10 / 90C11 / 90C29
Key words: Integer Programming / Multiple Objective Programming / Parametric Programming.
© EDP Sciences, ROADEF, SMAI, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.