Skip to main content
archive
Search Submit Donate Log in
Press Enter to search · Advanced search

Mathematics > Optimization and Control

arXiv:1111.1780 (math)
[Submitted on 8 Nov 2011 (v1), last revised 8 Jan 2013 (this version, v2)]

Title:The Triangle Closure is a Polyhedron

Authors:Amitabh Basu, Robert Hildebrand, Matthias Köppe
View a PDF of the paper titled The Triangle Closure is a Polyhedron, by Amitabh Basu and 2 other authors
View PDF HTML (experimental)
Abstract:Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with certain families of lattice-free sets are polyhedra. For a long time, the only result known was the celebrated theorem of Cook, Kannan and Schrijver who showed that the split closure is a polyhedron. Although some fairly general results were obtained by Andersen, Louveaux and Weismantel [ An analysis of mixed integer linear sets based on lattice point free convex sets, Math. Oper. Res. 35 (2010), 233--256] and Averkov [On finitely generated closures in the theory of cutting planes, Discrete Optimization 9 (2012), no. 4, 209--215], some basic questions have remained unresolved. For example, maximal lattice-free triangles are the natural family to study beyond the family of splits and it has been a standing open problem to decide whether the triangle closure is a polyhedron. In this paper, we show that when the number of integer variables $m=2$ the triangle closure is indeed a polyhedron and its number of facets can be bounded by a polynomial in the size of the input data. The techniques of this proof are also used to give a refinement of necessary conditions for valid inequalities being facet-defining due to Cornuéjols and Margot [On the facets of mixed integer programs with two integer variables and two constraints, Mathematical Programming 120 (2009), 429--456] and obtain polynomial complexity results about the mixed integer hull.
Comments: 39 pages; made self-contained by merging material from arXiv:1107.5068v1
Subjects: Optimization and Control (math.OC); Discrete Mathematics (cs.DM)
MSC classes: 90C11
Cite as: arXiv:1111.1780 [math.OC]
  (or arXiv:1111.1780v2 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.1111.1780
arXiv-issued DOI via DataCite

Submission history

From: Robert Hildebrand [view email]
[v1] Tue, 8 Nov 2011 01:47:24 UTC (111 KB)
[v2] Tue, 8 Jan 2013 23:20:21 UTC (219 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled The Triangle Closure is a Polyhedron, by Amitabh Basu and 2 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Current browse context:

math.OC
< prev   |   next >
new | recent | 2011-11
Change to browse by:
cs
cs.DM
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)
Major funding support from
Simons Foundation Simons Foundation International Schmidt Sciences