Digitale Medien
Springer
Mathematical programming
47 (1990), S. 11-18
ISSN:
1436-4646
Schlagwort(e):
Integer programming
;
cutting planes
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
Abstract Following Chvátal, cutting planes may be viewed as a proof system for establishing that a given system of linear inequalities has no integral solution. We show that such proofs may be carried out in polynomial workspace.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01580849
Permalink
Bibliothek |
Standort |
Signatur |
Band/Heft/Jahr |
Verfügbarkeit |