Digitale Medien
Springer
Mathematical programming
18 (1980), S. 94-99
ISSN:
1436-4646
Schlagwort(e):
Integer Programming
;
Integral Polyhedra
;
Linear Inequalities
;
Facets
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01588301
Permalink
Bibliothek |
Standort |
Signatur |
Band/Heft/Jahr |
Verfügbarkeit |