| Issue |
RAIRO-Oper. Res.
Volume 39, Number 4, October-December 2005
|
|
|---|---|---|
| Page(s) | 243 - 252 | |
| DOI | https://doi.org/10.1051/ro:2006004 | |
| Published online | 08 April 2006 | |
An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
1
Departamento de Matemáticas Aplicadas,
Facultad de Ingeniería, Universidad Central de Venezuela; quintero
jl@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:
8
September
2004
Accepted:
24
November
2005
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.
Key words: 0-1-Integer Programming / multiparametric programming / Bottleneck problem.
© EDP Sciences, 2006
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.