Electronic Resource
Springer
Mathematical programming
47 (1990), S. 11-18
ISSN:
1436-4646
Keywords:
Integer programming
;
cutting planes
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01580849
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |