Back to Search
Start Over
(1, k)-configurations and facets for packing problems.
- Source :
- Mathematical Programming; Dec1980, Vol. 18 Issue 1, p94-99, 6p
- Publication Year :
- 1980
-
Abstract
- A new class of facets for knapsack polytopes is obtained. This class of inequalities is shown to define a polytope with zero-one vertices only. A combinatorial inequality is obtained from Fulkerson's max-max inequality. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00255610
- Volume :
- 18
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Mathematical Programming
- Publication Type :
- Academic Journal
- Accession number :
- 71011830
- Full Text :
- https://doi.org/10.1007/BF01588301