Cutting-plane proofs in polynomial space

Cutting-plane proofs in polynomial space

0.00 Avg rating0 Votes
Article ID: iaor1991664
Country: Netherlands
Volume: 47
Issue: 1
Start Page Number: 11
End Page Number: 18
Publication Date: May 1990
Journal: Mathematical Programming (Series A)
Authors:
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. The paper shows that such proofs may be carried out in polynomial workspace.

Reviews

Required fields are marked *. Your email address will not be published.