Hi there, The assignment problem is a classic optimization problem:http://en.wikipedia.org/wiki/Assignment_problem The hungarian algorithm allows one to solve it in reasonable time: http://en.wikipedia.org/wiki/Hungarian_algorithm The mentioned library is an implementation of that algorithm in Cfrom Cyrill Stachniss of the University of Freiburg:http://www.informatik.uni-freiburg.de/~stachnis/misc.html If you ever need to solve that problem in your schemeadventures, make sure to consider that great tool. Have a nice day and thanks for Chicken Scheme!Mathieu
Date: Mon, 17 Feb 2014 10:29:02 +0900 Subject: Re: [Chicken-users] Solving the assignment problem using Chicken Scheme by interfacing with libhungarian From: [email protected] To: [email protected] CC: [email protected] Hello, This looks interesting, thanks. What is libhungarian and from where might one obtain it? -Ivan On Mon, Feb 17, 2014 at 5:48 AM, Mathieu <[email protected]> wrote: If you ever need to assign agents to tasks. First build a matrix where each row represents a task, each column represents an agent, and each element representsthe cost of having an agent performing a specific task. Then sent this matrix to the linked function to obtain a list of pairs representing which agent and task matchups have the minimal overall cost. An example: https://github.com/Mathieu-Desrochers/Scheme-Experimentations/blob/master/documentation/infrastructure/matrix.md#matrix-solve-maximum-assignment-problem The source code:https://github.com/Mathieu-Desrochers/Scheme-Experimentations/blob/master/sources/infrastructure/matrix/matrix-intern.scm *Credits to: http://www.informatik.uni-freiburg.de/~stachnis/ _______________________________________________ Chicken-users mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/chicken-users
_______________________________________________ Chicken-users mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/chicken-users
