1 reply to this topic

[solitaquinn]

Hi all,
i have a problem to determine the most suitable algorithm
for job vacancy matching algorithm.

there are some information about this problem :
there are many job seekers and many companies,
each company has many vacancies,
each vacancies would be filled more than one applicants.

i have search on the web about matching problem and the result are
weighted graph, bipartite matching, hungarian algorithm, marriage problem, etc.
when i continue to read it, it tells about one to one matching.
but job vacancy matching is not one to one matching, right? (cmiiw)

now, i confused. could you help me?

Thanks

[WingedPanther]

If you do something like a weighted graph, why not do the "best n matches", instead of the "best match"?