A carregar...
Publicação
Cutting Planes from Conditional Bounds for Generalized Set Covering Problems
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 352.95 KB | Adobe PDF |
Orientador(es)
Resumo(s)
This paper reports on the development of special cutting planes for the generalized set covering problem, GSCP, which is a covering problem where the variables and the right-hand sides are allowed to have any positive integer value. Those inequalities are, actually, a generalization of the cutting planes derived from conditional bounds and originally presented by Balas (1980), for the set covering problem. More recently, Hall & Hochbaum (1985) have extended those results for the multicovering problem. The generalized inequalities that we derive for the GSCP arc proved to be of the covering type and, hence, keeping the structure of the problem constraints.
Descrição
Palavras-chave
Cutting Planes Conditional Bounds Disjunctive Inequalities Generalized Set Covering Problem
Contexto Educativo
Citação
Pato, Margarida Vaz and José Pinto Paixão .(1989). “ Cutting Planes from Conditional Bounds for Generalized Set Covering Problems”. Investigação Operacional, Vol. 9 (1989), pp. 13-21.