Classical Assignment Problem

The Classical Assignment Problem is a combinatorial optimization problem in assignment theory that seeks to uniquely pair a set of agents with a set of tasks such that the total cost of assignment is minimized, typically under the condition that each agent is assigned to exactly one task and each task is assigned to exactly one agent.

37

Publications

2.1K

Citations

98

Authors

62

Institutions

Publications per year

2017–2026

3

Authors

98

  1. KG
    Keivan Ghoseiri

    Iran University of Science and Technology, Iran

    2 publications · 37 citations

    2

    h-index

  2. TD
    Tianyang Dong

    Zhejiang University of Technology, China

    2 publications · 55 citations

    2

    h-index

  3. JF
    Jing Fan

    Zhejiang University of Technology, China

    2 publications · 55 citations

    2

    h-index

  4. JW
    Jiaxing Wang

    Zhejiang University of Technology, China

    2 publications · 55 citations

    2

    h-index

  5. BC
    Bin Cao

    Zhejiang University of Technology, China

    2 publications · 55 citations

    2

    h-index

1–5 of 98

Venues

  1. Management Science

    1 publications · 200 citations

    1

    h-index

  2. Mathematical Programming

    1 publications · 19 citations

    1

    h-index

  3. IEEE Transactions on Reliability

    1 publications · 20 citations

    1

    h-index

  4. Methods of Information in Medicine

    1 publications · 16 citations

    1

    h-index

  5. The Computer Journal

    1 publications · 21 citations

    1

    h-index

1–5