IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/5803092.html
   My bibliography  Save this article

A Network Flow Algorithm for Solving Generalized Assignment Problem

Author

Listed:
  • Yongwen Hu
  • Qunpo Liu

Abstract

The generalized assignment problem (GAP) is an open problem in which an integer is given and one wants to assign agents to jobs such that the sum of the corresponding cost is minimal. Unlike the traditional - cardinality assignment problem, a job can be assigned to many, but different, agents and an agent may undertake several, but different, jobs in our problem. A network model with a special structure of GAP is given and an algorithm for GAP is proposed. Meanwhile, some important properties of the GAP are given. Numerical experiments are implemented, and the results indicate that the proposed algorithm can globally and efficiently optimize the GAP with a large range cost.

Suggested Citation

  • Yongwen Hu & Qunpo Liu, 2021. "A Network Flow Algorithm for Solving Generalized Assignment Problem," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-8, January.
    • Handle: RePEc:hin:jnlmpe:5803092
    DOI: 10.1155/2021/5803092
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/5803092.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2021/5803092.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/5803092?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
    ---><---

    Citations

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


    Cited by:

    1. Guojun Hu & Junran Lichen & Pengxiang Pan, 2023. "Two Combinatorial Algorithms for the Constrained Assignment Problem with Bounds and Penalties," Mathematics, MDPI, vol. 11(24), pages 1-12, December.

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:5803092. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.