IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v75y2019i3d10.1007_s10898-019-00749-2.html
   My bibliography  Save this article

Convergence and correctness of belief propagation for the Chinese postman problem

Author

Listed:
  • Guowei Dai

    (Nanjing Normal University
    Central China Normal University)

  • Fengwei Li

    (Shaoxing University)

  • Yuefang Sun

    (Shaoxing University)

  • Dachuan Xu

    (Beijing University of Technology)

  • Xiaoyan Zhang

    (Nanjing Normal University)

Abstract

Belief Propagation (BP), a distributed, message-passing algorithm, has been widely used in different disciplines including information theory, artificial intelligence, statistics and optimization problems in graphical models such as Bayesian networks and Markov random fields. Despite BP algorithm has a great success in many application fields and many progress about BP algorithm has been made, the rigorous analysis about the correctness and convergence of BP algorithm are known in only a few cases for arbitrary graph. In this paper, we will investigate the correctness and convergence of BP algorithm for determining the optimal solutions of the Chinese postman problem in both undirected and directed graphs. As a main result, we prove that BP algorithm converges to the optimal solution of the undirected Chinese postman problem within O(n) iterations where n represents the number of vertices, provided that the optimal solution is unique. For the directed case, we consider the directed Chinese postman problem with capacity and show that BP algorithm also converges to its optimal solution after O(n) iterations, as long as its corresponding linear programming relaxation has the unique optimal solution.

Suggested Citation

  • Guowei Dai & Fengwei Li & Yuefang Sun & Dachuan Xu & Xiaoyan Zhang, 2019. "Convergence and correctness of belief propagation for the Chinese postman problem," Journal of Global Optimization, Springer, vol. 75(3), pages 813-831, November.
    • Handle: RePEc:spr:jglopt:v:75:y:2019:i:3:d:10.1007_s10898-019-00749-2
    DOI: 10.1007/s10898-019-00749-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00749-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-019-00749-2?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. David Gamarnik & Devavrat Shah & Yehua Wei, 2012. "Belief Propagation for Min-Cost Network Flow: Convergence and Correctness," Operations Research, INFORMS, vol. 60(2), pages 410-428, April.
    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. Shuvomoy Das Gupta & Lacra Pavel, 2019. "On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems," Journal of Global Optimization, Springer, vol. 74(3), pages 523-548, July.

    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:jglopt:v:75:y:2019:i:3:d:10.1007_s10898-019-00749-2. 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.