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: | Susana Muñoz |
---|---|
Format: | Article |
Language: | English |
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 |
Similar Items
-
Enumerative combinatorics /
by: 380639 Charalambides, Charalambos A.
Published: (2002) -
Introduction to enumerative combinatorics /
by: 317882 Bona, Miklos
Published: (2007) -
Enumerative geometry and string theory /
by: 376168 Katz, Sheldon
Published: (2006) -
Enumerative problems in intersection theory
by: Giugni, Astrid Adele
Published: (2006) -
Arithmetic, enumerative induction and size bias
by: Paseau, AC
Published: (2021)