Rank: 15864 based on 0 downloads (last 30 days) and 0 file submitted
photo

Immanuel Weber

E-mail

Personal Profile:
Professional Interests:

 

Watch this Author's files

 

Comments and Ratings by Immanuel View all
Updated File Comments Rating
18 Aug 2010 LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0 A Matlab implementation of the Jonker-Volgenant algorithm solving LAPs. Author: Yi Cao

Hi Yi,
that was fast! Okay, that's the solution I want to avoid, as the task in my case is very time critical and resizing an existing 2d array appears to be very unattractive. But nevertheless thanks for your information and your good code.

Immanuel

17 Aug 2010 LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0 A Matlab implementation of the Jonker-Volgenant algorithm solving LAPs. Author: Yi Cao

Hi Yi,
as I used your Hungarian-Code before and I want to implement Jonkers&Volgenant's algorithm for rectangular matrices in C, your code was a nice finding. Do you use any of the algorithm modifications presented in Volgenant's papers "Linear and semi-assignment problems, a core oriented approach"[1996] and/or "Solving the Rectangular assignment problem and applications"[2010] to solve rectangular matrices? Or do you use a different, maybe simplier to understand approach?
I'm trying to implement the modifications presented in the last one, but I'm having difficulties with some of the lines in the pseudo code.
In addition I want to point out a little bug, which rarely will occur, but if you use 1x1 matrix as an input for your code, it will compute a NaN cost.

Immanuel

19 Dec 2008 Hungarian Algorithm for Linear Assignment Problems (V2.3) An extremely fast implementation of the Hungarian algorithm on a native Matlab code. Author: Yi Cao

Hey Yi
that was a fast bugfix for your fast algorithm.
switched back to it.
Thank you!

15 Dec 2008 Hungarian Algorithm for Linear Assignment Problems (V2.3) An extremely fast implementation of the Hungarian algorithm on a native Matlab code. Author: Yi Cao

Hi Yi, I used your algorithm and it did good work until I encountered a possible bug.
As long as the input matrix ist big enough it works fine, but when the matrix consists of only 2 entries the algorithm creates a wrong match. For example the matrix [1 0], the matching should be 1->2, a return of [2], but the algorithm returns 1->1 ([1]).
Caused by lack of time I switched for the moment to another algorithm, but it would be nice if you could post a bugfix.
In addition, I use it on R2006b, I can't test it on newer versions, so maybe this is related to the old one.

Contact us