| Name : perl-Algorithm-Bertsekas
| |
| Version : 0.87
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp155.1.1
| Date : 2023-07-20 18:15:47
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Algorithm-Bertsekas-0.87-lp155.1.1.src.rpm
|
| Size : 0.07 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : Auction Algorithm for the Assignment Problem.
|
Description :
The assignment problem in the general form can be stated as follows:
\"Given N jobs (or persons), M tasks (or objects) and the effectiveness of each job for each task,
the problem is to assign each job to one and only one task in such a way that the measure of
effectiveness is optimised (Maximised or Minimised).\"
\"Each assignment problem has associated with a table or matrix. Generally, the rows contain the
jobs (or persons) we wish to assign, and the columns comprise the tasks (or objects) we want them
assigned to. The numbers in the table are the costs associated with each particular assignment.\"
In Auction Algorithm (AA) the N persons iteratively submit the bids to M objects.
The AA take cost Matrix N�M = [aij] as an input and produce assignment as an output.
In the AA persons iteratively submit the bids to the objects which are then reassigned
to the bidders which offer them the best bid.
Another application is to find the (nearest/more distant) neighbors.
The distance between neighbors can be represented by a matrix or a weight function, for example:
1: f(i,j) = abs ($array1[i] - $array2[j])
2: f(i,j) = ($array1[i] - $array2[j]) ** 2
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-A/15.5/noarch |
