An enumerative procedure for identifying maximal covers
שמור ב:
| מחבר: | |
|---|---|
| פורמט: | artículo original |
| סטטוס: | Versión publicada |
| Fecha de Publicación: | 2003 |
| תיאור: | 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 |
| מוסד: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| שפה: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/233 |
| גישה מקוונת: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/233 |
| מילת מפתח: | Maximal covers tighter formulations knapsack constraints dominated inequalities Cubrimientos maximales formulaciones más fuertes restricciones de tipo mochila desigualdades dominadas |