IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v4y2012i3p225-246.html
   My bibliography  Save this article

Composition of graphs and the Hop-constrained Path Problem

Author

Listed:
  • F. Bendali
  • J. Mailfert
  • X. Tang

Abstract

Given a graph G = (V,E) and a non negative cost function on edges, the Hop-constrained Path Problem (HPP) consists of finding between two distinguished vertices s and t of V a minimum cost path with no more than L edges where L is a fixed integer. Dahl characterised the dominant of the convex hull of the incidence vectors of st-paths of length bounded by L, denoted by DL(G), for any graph G when L ≤ 3, using trivial, st-cut, and L-path-cut inequalities. A graph G is said L-h-simple if the set of Dahl's inequalities is sufficient to define DL(G). In this paper, we study the L-h-simple property when L ≥ 4. We present some results on the facial structure of the dominant DL(G). We also examine some basic operations on graphs which preserve the L-h-simple property.

Suggested Citation

  • F. Bendali & J. Mailfert & X. Tang, 2012. "Composition of graphs and the Hop-constrained Path Problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 4(3), pages 225-246.
    • Handle: RePEc:ids:ijmore:v:4:y:2012:i:3:p:225-246
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=46685
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijmore:v:4:y:2012:i:3:p:225-246. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.