Per citar aquest document: http://ddd.uab.cat/record/83
On the 0/1 knapsack polytope
Weismantel, Robert

Data: 1997
Resum: This paper deals with the 0/1 knapsack polytope. In particular, we introduce the class of weight inequalities. This class of inequalities is needed to describe the knapsack polyhedron when the weights of the items lie in certain intervals. A generalization of weight inequalities yields the so-called "weight-reduction principle" and the class of extended weight inequalities. The latter class of inequalities includes minimal cover and (1, k)-configuration inequalities. The properties of lifted minimal cover inequalities are extended to this general class of inequalities. .
Llengua: Anglès.
Document: Article ; recerca ; article ; publishedVersion
Matèria: Complete description ; Facets ; Knapsack polytope ; Knapsack problem ; Pseudo polynomial time ; Separation
Publicat a: Mathematical Programming, vol. 77 n. 1 (1997) p. 49-68, ISSN 0025-5610



20 p, 972.9 KB
 Accés restringit a la UAB

El registre apareix a les col·leccions:
Articles > Articles de recerca
Articles > Articles publicats

 Registre creat el 2006-03-13, darrera modificació el 2016-06-12



   Favorit i Compartir