A new algorithm for the assignment problem: An alternative to the Hungarian method

Ping Ji; Wing Bun Lee; Hongyu Li

doi:10.1016/S0305-0548(97)00019-1

A new algorithm for the assignment problem: An alternative to the Hungarian method

Ping Ji, Wing Bun Lee, Hongyu Li

Research output: Journal article publication › Journal article › Academic research › peer-review

16 Citations (Scopus)

Abstract

This paper presents a new algorithm for the well-studied assignment problem. Our assignment algorithm is based on a 2n × 2n matrix. The dual to the assignment problem is considered in this paper by relaxing the constraints of the original assignment problem. A 2n × 2n matrix is formed for an initial feasible solution to the dual. Then operations are performed on the matrix until an optimal solution is found.

Original language	English
Pages (from-to)	1017-1023
Number of pages	7
Journal	Computers and Operations Research
Volume	24
Issue number	11
DOIs	https://doi.org/10.1016/S0305-0548(97)00019-1
Publication status	Published - 1 Jan 1997

ASJC Scopus subject areas

General Computer Science
Modelling and Simulation
Management Science and Operations Research

More information

10.1016/S0305-0548(97)00019-1

Cite this

@article{ab5da5da8a1643fd93c6625dd544890d,

title = "A new algorithm for the assignment problem: An alternative to the Hungarian method",

abstract = "This paper presents a new algorithm for the well-studied assignment problem. Our assignment algorithm is based on a 2n × 2n matrix. The dual to the assignment problem is considered in this paper by relaxing the constraints of the original assignment problem. A 2n × 2n matrix is formed for an initial feasible solution to the dual. Then operations are performed on the matrix until an optimal solution is found.",

author = "Ping Ji and Lee, \{Wing Bun\} and Hongyu Li",

year = "1997",

month = jan,

day = "1",

doi = "10.1016/S0305-0548(97)00019-1",

language = "English",

volume = "24",

pages = "1017--1023",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "11",

}

TY - JOUR

T1 - A new algorithm for the assignment problem: An alternative to the Hungarian method

AU - Ji, Ping

AU - Lee, Wing Bun

AU - Li, Hongyu

PY - 1997/1/1

Y1 - 1997/1/1

N2 - This paper presents a new algorithm for the well-studied assignment problem. Our assignment algorithm is based on a 2n × 2n matrix. The dual to the assignment problem is considered in this paper by relaxing the constraints of the original assignment problem. A 2n × 2n matrix is formed for an initial feasible solution to the dual. Then operations are performed on the matrix until an optimal solution is found.

AB - This paper presents a new algorithm for the well-studied assignment problem. Our assignment algorithm is based on a 2n × 2n matrix. The dual to the assignment problem is considered in this paper by relaxing the constraints of the original assignment problem. A 2n × 2n matrix is formed for an initial feasible solution to the dual. Then operations are performed on the matrix until an optimal solution is found.

UR - https://www.scopus.com/pages/publications/0031281281

U2 - 10.1016/S0305-0548(97)00019-1

DO - 10.1016/S0305-0548(97)00019-1

M3 - Journal article

SN - 0305-0548

VL - 24

SP - 1017

EP - 1023

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 11

ER -

A new algorithm for the assignment problem: An alternative to the Hungarian method

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this