Advanced Search
MyIDEAS: Login to save this paper or follow this series

On the Equivalence between some Local and Global Chinese Postman and Traveling Salesman Graphs


Author Info

  • Granot, D.
  • Hamers, H.J.M.

    (Tilburg University, Center for Economic Research)

Registered author(s):


    A connected graph G=(V,E), a vertex in V and a non-negative weight function defined on Ecan be used to induce Chinese postman and traveling salesman (cooperative) games. A graph G=(V,E) is said to be locally (respectively, globally) Chinese postman balanced (respectively, totally balanced, submodular) if for at least one vertex (respectively, for all vertices) in V and any non-negative weight function defined on E, the corresponding Chinese postman game is balanced (respectively, totally balanced, submodular). Local and global traveling salesman balanced (respectively, totally balanced, submodular) graphs are similarly defined. In this paper we study the equivalence between local and global Chinese postman balanced (respectively, totally balanced, submodular) graphs, and between local and global traveling salesman submodular graphs.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Richard Broekman)
    Download Restriction: no

    Bibliographic Info

    Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2000-48.

    as in new window
    Date of creation: 2000
    Date of revision:
    Handle: RePEc:dgr:kubcen:200048

    Contact details of provider:
    Web page:

    Related research

    Keywords: cooperative game; Chinese postman; traveling salsesman; core; submodularity;


    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Hamers, H.J.M. & Borm, P.E.M. & Leensel, A. van den & Tijs, S.H., 1999. "Cost allocation in the Chinese postman problem," Open Access publications from Tilburg University urn:nbn:nl:ui:12-80680, Tilburg University.
    2. Potters, J.A.M. & Curiel, I. & Tijs, S.H., 1992. "Traveling salesman games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154221, Tilburg University.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations research games: A survey," Open Access publications from Tilburg University urn:nbn:nl:ui:12-305110, Tilburg University.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:dgr:kubcen:200048. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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