IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v21y2013i3p474-481.html
   My bibliography  Save this article

Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

Author

Listed:
  • Jesús Loera

Abstract

No abstract is available for this item.

Suggested Citation

  • Jesús Loera, 2013. "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 474-481, October.
    • Handle: RePEc:spr:topjnl:v:21:y:2013:i:3:p:474-481
    DOI: 10.1007/s11750-013-0291-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-013-0291-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-013-0291-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Betke, U. & Gritzmann, P., 1992. "Projection algorithms for linear programming," European Journal of Operational Research, Elsevier, vol. 60(3), pages 287-295, August.
    2. Francisco Santos, 2013. "Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 426-460, October.
    3. Yinyu Ye, 2011. "The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 593-603, November.
    4. Telgen, Jan, 1982. "On relaxation methods for systems of linear inequalities," European Journal of Operational Research, Elsevier, vol. 9(2), pages 184-189, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ilbin Lee & Marina A. Epelman & H. Edwin Romeijn & Robert L. Smith, 2017. "Simplex Algorithm for Countable-State Discounted Markov Decision Processes," Operations Research, INFORMS, vol. 65(4), pages 1029-1042, August.
    2. David B. Brown & James E. Smith, 2013. "Optimal Sequential Exploration: Bandits, Clairvoyants, and Wildcats," Operations Research, INFORMS, vol. 61(3), pages 644-665, June.
    3. Fabio Vitor & Todd Easton, 2018. "The double pivot simplex method," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 109-137, February.
    4. V Varagapriya & Vikas Vikram Singh & Abdel Lisser, 2023. "Joint chance-constrained Markov decision processes," Annals of Operations Research, Springer, vol. 322(2), pages 1013-1035, March.
    5. Isaac M. Sonin & Constantine Steinberg, 2016. "Continue, quit, restart probability model," Annals of Operations Research, Springer, vol. 241(1), pages 295-318, June.
    6. Eugene A. Feinberg & Jefferson Huang, 2019. "On the reduction of total‐cost and average‐cost MDPs to discounted MDPs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 38-56, February.
    7. Guillot, Matthieu & Stauffer, Gautier, 2020. "The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective," European Journal of Operational Research, Elsevier, vol. 285(1), pages 148-158.
    8. Mark E. Lewis & Anand Paul, 2019. "Uniform Turnpike Theorems for Finite Markov Decision Processes," Management Science, INFORMS, vol. 44(4), pages 1145-1160, November.
    9. Amitabh Basu & Jesús A. De Loera & Mark Junod, 2014. "On Chubanov's Method for Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 336-350, May.
    10. Mengdi Wang, 2020. "Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 517-546, May.
    11. Bouchra El Akraoui & Daoui Cherki, 2023. "Solving Finite-Horizon Discounted Non-Stationary MDPS," Folia Oeconomica Stetinensia, Sciendo, vol. 23(1), pages 1-15, June.
    12. Edoardo Amaldi & Raphael Hauser, 2005. "Boundedness Theorems for the Relaxation Method," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 939-955, November.
    13. José Niño-Mora, 2022. "Multi-Gear Bandits, Partial Conservation Laws, and Indexability," Mathematics, MDPI, vol. 10(14), pages 1-31, July.
    14. Tamás Terlaky, 2013. "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 461-467, October.
    15. Guy Even & Alexander Zadorojniy, 2012. "Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks," Annals of Operations Research, Springer, vol. 201(1), pages 159-167, December.
    16. Ian Post & Yinyu Ye, 2015. "The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 859-868, October.
    17. Liu, Ming & Lin, Tao & Chu, Feng & Ding, Yueyu & Zheng, Feifeng & Chu, Chengbin, 2023. "Bi-objective optimization for supply chain ripple effect management under disruption risks with supplier actions," International Journal of Production Economics, Elsevier, vol. 265(C).
    18. Archis Ghate & Robert L. Smith, 2013. "A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes," Operations Research, INFORMS, vol. 61(2), pages 413-425, April.
    19. Bruno Scherrer, 2016. "Improved and Generalized Upper Bounds on the Complexity of Policy Iteration," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 758-774, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:21:y:2013:i:3:p:474-481. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.