A dual feasible forest algorithm for the linear assignment problem
RAIRO-Oper. Res., 25 4 (1991) 403-411
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A Graph-Based Neural Approach to Linear Sum Assignment Problems
Carlo Aironi, Samuele Cornell and Stefano SquartiniInternational Journal of Neural Systems 34 (03) (2024)
https://doi.org/10.1142/S0129065724500114
GLAN: A graph-based linear assignment network
He Liu, Tao Wang, Congyan Lang, Songhe Feng, Yi Jin and Yidong LiPattern Recognition 155 110694 (2024)
https://doi.org/10.1016/j.patcog.2024.110694
Bidirectional Long Short-Term Memory Neural Networks for Linear Sum Assignment Problems
Nguyen Minh-Tuan and Yong-Hwa KimApplied Sciences 9 (17) 3470 (2019)
https://doi.org/10.3390/app9173470
On the initialization methods of an exterior point algorithm for the assignment problem
C. Papamanthou, K. Paparrizos, N. Samaras and A. SifalerasInternational Journal of Computer Mathematics 87 (8) 1831 (2010)
https://doi.org/10.1080/00207160802524739
Handbook of Combinatorial Optimization
Rainer E. Burkard and Eranda ÇelaHandbook of Combinatorial Optimization 75 (1999)
https://doi.org/10.1007/978-1-4757-3023-4_2
Combinatorial Optimization
Konstantinos PaparrizosCombinatorial Optimization 303 (1992)
https://doi.org/10.1007/978-3-642-77489-8_31