IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v46y2021i4p1366-1389.html
   My bibliography  Save this article

Feasible Bases for a Polytope Related to the Hamilton Cycle Problem

Author

Listed:
  • Thomas Kalinowski

    (Department of Mathematics, School of Science and Technology, University of New England, Armidale, New South Wales 2350, Australia)

  • Sogol Mohammadian

    (Department of Mathematics, School of Mathematical and Physical Sciences, University of Newcastle, Callaghan, New South Wales 2308, Australia)

Abstract

We study a certain polytope depending on a graph G and a parameter β ∈ (0,1) that arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process. Literature suggests a conjecture a lower bound on the proportion of feasible bases corresponding to Hamiltonian cycles in the set of all feasible bases. We make progress toward a proof of the conjecture by proving results about the structure of feasible bases. In particular, we prove three main results: (1) the set of feasible bases is independent of the parameter β when the parameter is close to one, (2) the polytope can be interpreted as a generalized network flow polytope, and (3) we deduce a combinatorial interpretation of the feasible bases. We also provide a full characterization for a special class of feasible bases, and we apply this to provide some computational support for the conjecture.

Suggested Citation

  • Thomas Kalinowski & Sogol Mohammadian, 2021. "Feasible Bases for a Polytope Related to the Hamilton Cycle Problem," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1366-1389, November.
    • Handle: RePEc:inm:ormoor:v:46:y:2021:i:4:p:1366-1389
    DOI: 10.1287/moor.2020.1112
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2020.1112
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2020.1112?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
    ---><---

    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:inm:ormoor:v:46:y:2021:i:4:p:1366-1389. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.