An enumerative procedure for identifying maximal covers

 

Guardado en:
Detalles Bibliográficos
Autor: Muñoz, S.
Formato: artículo original
Estado:Versión publicada
Fecha de Publicación:2003
Descripción:In this paper we present an enumerative procedure for identifying all maximal covers from the set of covers implied by a 0-1 knapsack constraint. The inequalities induced by these maximal covers are not dominated by the inequality induced by any other cover implied by the knapsack constraint. Thus, their identification can help to tighten 0-1 models. On the other hand, we present an improvement on a procedure taken from the literature for identifying certain maximal covers. Some comparative computational experiments where both procedures have been applied to randomly generated knapsack constraints are also reported.
País:Portal de Revistas UCR
Institución:Universidad de Costa Rica
Repositorio:Portal de Revistas UCR
Lenguaje:Español
OAI Identifier:oai:portal.ucr.ac.cr:article/233
Acceso en línea:https://revistas.ucr.ac.cr/index.php/matematica/article/view/233
Palabra clave:Maximal covers
tighter formulations
knapsack constraints
dominated inequalities
Cubrimientos maximales
formulaciones más fuertes
restricciones de tipo mochila
desigualdades dominadas