4 ms·
> for matching candidates to jobs. A lot is known about matching. A lot of the work boils down to min cost network flows on a network with arcs with costs per
by graycat 11y ago
> for matching candidates to jobs.
A lot is known about matching. A lot of the work boils down to min cost network flows on a network with arcs with costs per unit flow and a maximum flow that is an integer. The problem, then, is integer linear programming but in this case the old linear programming simplex algorithm returns integer results for no extra effort. A nice modification is due to W. Cunningham, one of my profs, later Chair at Waterloo's Department of Combinatorics and Optimization.
What matching problem do you have in mind?
- clairity 11y agoare you talking about codifying the matching rules as cost functions and then optimizing that as a linear system of equations? that's something i remember doing in college, but it's been a while. =) are there any existing software tools out there that helps in that regard? i'm not sure it fits my use case, but it's good to explore. i'm working on a platform that helps hourly workers find jobs. today that matching is fairly straightforward, but it will get more complicated over time as we get develop better heuristics for matching candidates. it would be nice to be declarative about the matching rules and let the system figure out how to do the matching.
- graycat 11y agoI used to work in a project that was trying to program using rules. I gave up on rules. Sorry about that: I just couldn't see rules as an effective way to specify a problem or get a solution.