An algorithm for multiparametric min max 0-1-Integer Programming problems relative to the objective function

被引:1
|
作者
Quintero, JL
Crema, A
机构
[1] Cent Univ Venezuela, Fac Ingn, Dept Matemat Aplicada, Caracas 1041A, Venezuela
[2] Cent Univ Venezuela, Fac Ciencias, Escuela Computac, Caracas 1041A, Venezuela
关键词
0-1-Integer Programming; multiparametric programming; Bottleneck problem;
D O I
10.1051/ro:2006004
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.
引用
收藏
页码:243 / 252
页数:10
相关论文
共 50 条