| Date: |
1997 |
| Abstract: |
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. . |
| Rights: |
Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.  |
| Language: |
Anglès |
| Document: |
Article ; recerca ; Versió publicada |
| Subject: |
Complete description ;
Facets ;
Knapsack polytope ;
Knapsack problem ;
Pseudo polynomial time ;
Separation |
| Published in: |
Mathematical Programming, vol. 77 n. 1 (1997) p. 49-68, ISSN 0025-5610 |
guest ::
UAB restricted access
