Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
On the Simplex Method for 0/1-Polytopes. |
| Συγγραφείς: |
Black, Alexander E.1 (AUTHOR) aeblack@ucdavis.edu, De Loera, Jesús A.1 (AUTHOR) deloera@math.ucdavis.edu, Kafer, Sean2 (AUTHOR) skafer3@gatech.edu, Sanità, Laura3 (AUTHOR) laura.sanita@bocconi.it |
| Πηγή: |
Mathematics of Operations Research (INFORMS). May2025, Vol. 50 Issue 2, p1398-1420. 23p. |
| Θεματικοί όροι: |
Simplex algorithm, Combinatorial optimization, Polytopes, Geometry, Polynomials |
| Εταιρία/Οντότητα: |
National Science Foundation (U.S.) |
| Περίληψη: |
We present three new pivot rules for the Simplex method for Linear Programs over 0/1-polytopes. We show that the number of nondegenerate steps taken using these three rules is strongly polynomial, linear in the number of variables, and linear in the dimension. Our bounds on the number of steps are asymptotically optimal on several well-known combinatorial polytopes. Our analysis is based on the geometry of 0/1-polytopes and novel modifications to the classical steepest-edge and shadow-vertex pivot rules. We draw interesting connections between our pivot rules and other well-known algorithms in combinatorial optimization. Funding: A. E. Black and J. A. De Loera are grateful for the support received through the National Science Foundation [Grants DMS-1818969 and NSF GRFP]. L. Sanita is grateful for the support received from the Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Grant VI.Vidi.193.087]. [ABSTRACT FROM AUTHOR] |
|
Copyright of Mathematics of Operations Research (INFORMS) is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |
