How to Find the Convex Hull of All Integer Points in a Polyhedron?
We propose a cut-based algorithm for finding all vertices and all facets of the convex hull of all integer points of a polyhedron defined by a system of linear inequalities. Our algorithm DDM Cuts is based on the Gomory cuts and the dynamic version of the double description method. We describe the c...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Semenov, S. O Zolotykh, N. Yu |
| description | We propose a cut-based algorithm for finding all vertices and all facets of
the convex hull of all integer points of a polyhedron defined by a system of
linear inequalities. Our algorithm DDM Cuts is based on the Gomory cuts and the
dynamic version of the double description method. We describe the computer
implementation of the algorithm and present the results of computational
experiments comparing our algorithm with a naive one. |
| doi_str_mv | 10.48550/arxiv.2010.13147 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2010_13147</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2010_13147</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-308496fed888101471b2dceac246dc4f1a59b39b5efa3b85faa50ec2d63772503</originalsourceid><addsrcrecordid>eNotj71OwzAUhb0woMIDMHFfIMW_sTOhElFSqRIM3aOb-JpaCjZKQ2nfnlCYvqMznKOPsTvBl9oZwx9wPMXjUvK5EEpoe82emvwNU4Z1TB6mPUGd05FO0HwNA-QAqxmbNNE7jfCWY5oOEBPgnIfznvyY0-MNuwo4HOj2nwu2Wz_v6qbYvr5s6tW2wNLaQnGnqzKQd84JPn-LTvqesJe69L0OAk3VqaozFFB1zgREw6mXvlTWSsPVgt3_zV4k2s8xfuB4bn9l2ouM-gGlqkMP</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>How to Find the Convex Hull of All Integer Points in a Polyhedron?</title><source>arXiv.org</source><creator>Semenov, S. O ; Zolotykh, N. Yu</creator><creatorcontrib>Semenov, S. O ; Zolotykh, N. Yu</creatorcontrib><description>We propose a cut-based algorithm for finding all vertices and all facets of
the convex hull of all integer points of a polyhedron defined by a system of
linear inequalities. Our algorithm DDM Cuts is based on the Gomory cuts and the
dynamic version of the double description method. We describe the computer
implementation of the algorithm and present the results of computational
experiments comparing our algorithm with a naive one.</description><identifier>DOI: 10.48550/arxiv.2010.13147</identifier><language>eng</language><subject>Computer Science - Computational Geometry ; Mathematics - Combinatorics ; Mathematics - Optimization and Control</subject><creationdate>2020-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2010.13147$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2010.13147$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Semenov, S. O</creatorcontrib><creatorcontrib>Zolotykh, N. Yu</creatorcontrib><title>How to Find the Convex Hull of All Integer Points in a Polyhedron?</title><description>We propose a cut-based algorithm for finding all vertices and all facets of
the convex hull of all integer points of a polyhedron defined by a system of
linear inequalities. Our algorithm DDM Cuts is based on the Gomory cuts and the
dynamic version of the double description method. We describe the computer
implementation of the algorithm and present the results of computational
experiments comparing our algorithm with a naive one.</description><subject>Computer Science - Computational Geometry</subject><subject>Mathematics - Combinatorics</subject><subject>Mathematics - Optimization and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71OwzAUhb0woMIDMHFfIMW_sTOhElFSqRIM3aOb-JpaCjZKQ2nfnlCYvqMznKOPsTvBl9oZwx9wPMXjUvK5EEpoe82emvwNU4Z1TB6mPUGd05FO0HwNA-QAqxmbNNE7jfCWY5oOEBPgnIfznvyY0-MNuwo4HOj2nwu2Wz_v6qbYvr5s6tW2wNLaQnGnqzKQd84JPn-LTvqesJe69L0OAk3VqaozFFB1zgREw6mXvlTWSsPVgt3_zV4k2s8xfuB4bn9l2ouM-gGlqkMP</recordid><startdate>20201025</startdate><enddate>20201025</enddate><creator>Semenov, S. O</creator><creator>Zolotykh, N. Yu</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20201025</creationdate><title>How to Find the Convex Hull of All Integer Points in a Polyhedron?</title><author>Semenov, S. O ; Zolotykh, N. Yu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-308496fed888101471b2dceac246dc4f1a59b39b5efa3b85faa50ec2d63772503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Computational Geometry</topic><topic>Mathematics - Combinatorics</topic><topic>Mathematics - Optimization and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Semenov, S. O</creatorcontrib><creatorcontrib>Zolotykh, N. Yu</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Semenov, S. O</au><au>Zolotykh, N. Yu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>How to Find the Convex Hull of All Integer Points in a Polyhedron?</atitle><date>2020-10-25</date><risdate>2020</risdate><abstract>We propose a cut-based algorithm for finding all vertices and all facets of
the convex hull of all integer points of a polyhedron defined by a system of
linear inequalities. Our algorithm DDM Cuts is based on the Gomory cuts and the
dynamic version of the double description method. We describe the computer
implementation of the algorithm and present the results of computational
experiments comparing our algorithm with a naive one.</abstract><doi>10.48550/arxiv.2010.13147</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2010.13147 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2010_13147 |
| source | arXiv.org |
| subjects | Computer Science - Computational Geometry Mathematics - Combinatorics Mathematics - Optimization and Control |
| title | How to Find the Convex Hull of All Integer Points in a Polyhedron? |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T18%3A58%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=How%20to%20Find%20the%20Convex%20Hull%20of%20All%20Integer%20Points%20in%20a%20Polyhedron?&rft.au=Semenov,%20S.%20O&rft.date=2020-10-25&rft_id=info:doi/10.48550/arxiv.2010.13147&rft_dat=%3Carxiv_GOX%3E2010_13147%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |