An enumerative procedure for identifying maximal covers
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,...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Spanish |
| Published: |
Universidad de Costa Rica
2009-02-01
|
| Series: | Revista de Matemática: Teoría y Aplicaciones |
| Online Access: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/233 |