On the 0/1 knapsack polytope

Fecha:	1997
Resumen:	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. .
Derechos:	Tots els drets reservats.
Lengua:	Anglès
Documento:	Article ; recerca ; Versió publicada
Materia:	Complete description ; Facets ; Knapsack polytope ; Knapsack problem ; Pseudo polynomial time ; Separation
Publicado en:	Mathematical Programming, vol. 77 n. 1 (1997) p. 49-68, ISSN 0025-5610

20 p, 972.9 KB

Acceso restringido a la UAB

Registro creado el 2006-03-13, última modificación el 2023-06-03