MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The Gomory-Chvátal closure of a non-rational polytope is a rational polytope

Author(s)
Dunkel, Juliane; Schulz, Andreas S
Thumbnail
Downloaddunkel-schulz-final1.pdf (467.6Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
Abstract
The question as to whether the Gomory-Chvátal closure of a nonrational polytope is a polytope has been a longstanding open problem in integer programming. In this paper, we answer this question in the affirmative by combining ideas from polyhedral theory and the geometry of numbers.
Date issued
2012-11
URI
http://hdl.handle.net/1721.1/77903
Department
Massachusetts Institute of Technology. Operations Research Center; Sloan School of Management
Journal
Mathematics of Operations Research
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Citation
Dunkel, J., and A. S. Schulz. “The Gomory-Chvatal Closure of a Nonrational Polytope Is a Rational Polytope.” Mathematics of Operations Research 38.1 (2012): 63–91. CrossRef. Web.
Version: Author's final manuscript
ISSN
0364-765X
1526-5471

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.