Enumerating the set of non-dominated vectors in multiple objective integer linear programming

被引：8
|
作者：
Sylva, John [1 ]
Crema, Alejandro [2 ]
机构：
[1] Cent Univ Venezuela, Fac Ingn, Dept Matemat Aplicada, Caracas, Venezuela
[2] Cent Univ Venezuela, Fac Ciencias, Escuela Comp, Caracas 1041A, Venezuela
来源：
RAIRO-OPERATIONS RESEARCH | 2008年 / 42卷 / 03期
关键词：
integer programming; Multiple Objective Programming; Parametric Programming;
D O I：
10.1051/ro:2008018
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：371 / 387
页数：17
相关论文
共 50 条
12345