Issue |
RAIRO-Oper. Res.
Volume 43, Number 1, January-March 2009
|
|
---|---|---|
Page(s) | 1 - 12 | |
DOI | https://doi.org/10.1051/ro/2009002 | |
Published online | 28 January 2009 |
An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
1
Departamento de Matemáticas Aplicadas,
Facultad de Ingeniería,
Universidad Central de Venezuela,
Apartado 47002, Caracas 1041-A, Venezuela;
quinterojl@tutopia.com
2
Escuela de Computación,
Facultad de Ciencias,
Universidad Central de Venezuela,
Apartado 47002, Caracas 1041-A, Venezuela;
acrema@kuaimare.ciens.ucv.ve
Received:
17
October
2007
Accepted:
3
July
2008
The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of 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 a generalized min max objective function such that the min sum and min max are particular cases.
Mathematics Subject Classification: 90C10 / 90C31
Key words: 0-1-Integer Programming / multiparametric programming / Bottleneck problem.
© EDP Sciences, ROADEF, SMAI, 2009
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.