Advanced Search
MyIDEAS: Login to save this article or follow this journal

Cost allocation in the Chinese postman problem


Author Info

  • Hamers, Herbert
  • Borm, Peter
  • van de Leensel, Robert
  • Tijs, Stef


No abstract is available for this item.

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:
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Elsevier in its journal European Journal of Operational Research.

Volume (Year): 118 (1999)
Issue (Month): 1 (October)
Pages: 153-163

as in new window
Handle: RePEc:eee:ejores:v:118:y:1999:i:1:p:153-163

Contact details of provider:
Web page:

Related research


Other versions of this item:


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, Herbert, 1997. "On the concavity of delivery games," European Journal of Operational Research, Elsevier, vol. 99(2), pages 445-458, June.
  2. Granot, D. & Hamers, H.J.M. & Tijs, S.H., 1996. "Weakly cyclic graphs and delivery games," Discussion Paper 96.110, Tilburg University, Center for Economic Research.
  3. Derks, J.J.M. & Tijs, S.H., 1986. "Totally balanced multi-commodity games and flow games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154258, Tilburg University.
  4. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
  5. 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.
  6. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154243, 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.
  2. Granot, Daniel & Hamers, Herbert & Kuipers, Jeroen & Maschler, Michael, 2011. "On Chinese postman games where residents of each road pay the cost of their road," Games and Economic Behavior, Elsevier, vol. 72(2), pages 427-438, June.
  3. Platz, T.T. & Hamers, H.J.M., 2013. "On Games Arising From Multi-Depot Chinese Postman Problems," Discussion Paper 2013-005, Tilburg University, Center for Economic Research.
  4. Granot, D. & Hamers, H.J.M., 2000. "On the Equivalence between some Local and Global Chinese Postman and Traveling Salesman Graphs," Discussion Paper 2000-48, Tilburg University, Center for Economic Research.
  5. D. Granot & H. Hamers & J. Kuipers & M. Maschler, 2004. "Chinese Postman Games on a Class of Eulerian Graphs," Discussion Paper Series dp366, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  6. Hamers, H.J.M. & Josune Albizuri, M., 2013. "Graphs Inducing Totally Balanced and Submodular Chinese Postman Games," Discussion Paper 2013-006, Tilburg University, Center for Economic Research.
  7. Matsubayashi, Nobuo & Umezawa, Masashi & Masuda, Yasushi & Nishino, Hisakazu, 2005. "A cost allocation problem arising in hub-spoke network systems," European Journal of Operational Research, Elsevier, vol. 160(3), pages 821-838, February.


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:eee:ejores:v:118:y:1999:i:1:p:153-163. 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: (Zhang, Lei).

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.