IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v40y2023i06ns0217595922500373.html
   My bibliography  Save this article

Belief Propagation for Unbalanced Assignment Problem

Author

Listed:
  • Yajing Wang

    (Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China)

  • Dongyue Liang

    (Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China)

  • Weihua Yang

    (Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China)

Abstract

The unbalanced assignment problem (UAP) aims to distribute a set of jobs to some workers. The cost of the jobs is different when they are distributed to different workers. The goal is: (1) minimizing the total cost of arranging jobs to workers; (2) making the distribution of jobs as even as possible among all the workers. We transform the UAP into a min-cost network flow problem with squared terms, and apply the belief propagation (BP) algorithm to deal with it. We prove that, when the min-cost network flow problem has a unique optimal solution, the BP algorithm converges to the optimal solution within O(βn 𠜀 ) iterations, where n represents the number of vertices of the flow network, 𠜀 is the difference between value of the optimal solution and the second optimal solution and β is the maximum value of the terms of the objective function. Next, we prove that BP converges to the optimal solution in O(β2n2μmlog n) operations, where m represents the number of edges and μ is the tight upper bound of the slope of the terms of the objective function.

Suggested Citation

  • Yajing Wang & Dongyue Liang & Weihua Yang, 2023. "Belief Propagation for Unbalanced Assignment Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(06), pages 1-19, December.
    • Handle: RePEc:wsi:apjorx:v:40:y:2023:i:06:n:s0217595922500373
    DOI: 10.1142/S0217595922500373
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595922500373
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595922500373?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.

    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:wsi:apjorx:v:40:y:2023:i:06:n:s0217595922500373. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.