An enumerative procedure for identifying maximal covers
Сохранить в:
| Автор: | |
|---|---|
| Формат: | artículo original |
| Статус: | Versión publicada |
| Дата публикации: | 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. |
| Страна: | 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 |
| Online-ссылка: | 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 |