ISSN:
1436-4646
Keywords:
Integer Programming
;
Integral Polyhedra
;
Linear Inequalities
;
Facets
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01588301
Permalink