Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Rapid PHP 2018 15.5
IBDAC 6.4
Online Course Booking Script 1.3.3
Database Workbench Pro 5.6.4
Job Portal Script 1.3.2
The C# PDF Library 5.2
PostgreSQL Data Access Components 6.0
Virtual Data Access Components 11.0
HTMLPad 2018 15.5
WeBuilder 2018 15.5
SentiMask SDK Trial 2.0.0
Track Order For Magento 2 1.0.0
Calendar 365 For Dynamics CRM 4.0
Scimbo 1.2
Odoo Furnito Theme 1.0
Top Code
PostgreSQL Data Access Components 4.4
Database Workbench Pro 5.6.4
Availability Booking Calendar PHP 1.0
Online Course Booking Script 3.04
ATN Site Builder 3.0
ATN Resume Finder 2.0
PHP Review Script 1.0
IBDAC 6.4
ICPennyBid Penny Auction Script 4.0
Invoice Manager by PHPJabbers 3.0
The C# PDF Library 1.0
Azizi search engine script PHP 4.1.10
HTMLPad 2018 15.5
Aglowsoft SQL Query Tools 8.2
Classified Ad Lister 1.0
Top Rated
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
K-Best Assignment Algorithm 1.0
File ID: 80913






K-Best Assignment Algorithm 1.0
Download K-Best Assignment Algorithm 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 10.0 KB
Downloads: 21
Submit Rating:
K-Best Assignment Algorithm 1.0 Description
Description: This implementation is based on the 1968 Murty algorithm for finding a ranked list of the best assignments for an arbitrary cost matrix.

This algorithm uses a user-supplied assignment algorithm, such as the Munkres (Hungarian) algorithm or the JV algorithm to obtain an arbitrary number of best assignment solutions.

Implementations of Munkres and JV algorithms by Yi Cao can be found here:

Munkres: http://www.mathworks.com/matlabcentral/fileexchange/20328

JV: http://www.mathworks.com/matlabcentral/fileexchange/26836

License: Shareware

Related: obtain, hungarian, munkres, Number, Solutions, Found, Algorithms, implementations, assignment, usersupplied

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 21



More Similar Code

This function is based on Yen's k-Shortest Path algorithm (1971)
It retuns:
1) [shortestPaths]: the list of K shortest paths (in cell array 1xK)
2) [totalCosts] : costs of the K shortest paths (in array 1xK)
Yen's algorithm prevents loops.

This function calls a slightly modified/simplified function dijkstra() (submitted by Xiaodong Wang, 2004)

The Network/Graph of N nodes is fed in the form of a NXN...



Provide a simple k-mean clustering algorithm in ruby.



Usage: [means,c]=KNMCluster(k,indata)

KNMCluster is an implementation of the K-means clustering algorithm. It takes inputs k and indata. k is the initial guess of the number of clusters.

indata is the aggregate data that you...



A fast artificial intelligence library which currently supports:
kNN (k-Nearest Neighbor algorithm)
MLP (Multilayer-Perceptron)



Munkres algorithm (also known as Hungarian algorithm) is an efficient algorithm to solve the assignment problem in polynomial-time. The algorithm has many applications in combinatorial optimization, for example in Traveling Salesman problem.



This is a tool for K-means clustering. After trying several different ways to program, I got the conclusion that using simple loops to perform distance calculation and comparison is most efficient and accurate because of the JIT acceleration in...



This is an implementation of the paper
k-means++: the advantages of careful seeding.

It converges very quickly.



This package is created with the highly appreciated theoretical help and under the supervision of Prof. DSc. Ketty Peeva.

Theoretical results and methods can be found in:
1. B. De Baets, Analytical solution methods for fuzzy...



Generate a Gamma random variable
"Statistical Distributions", Evans, Hastings, Peacock, 2nd Edition,
Wiley, 1993, p.75-81

INPUTS:
(N,M) = size of array of random variables to generate
b = scale...



If you like the idea behind MATLAB's linsolve or Tim Davis' linfactor, you might find trilin useful as well.

Let's say you have a generalized least squares problem,

x = C * u
C = inv(N)

where

N =...

User Review for K-Best Assignment Algorithm
- required fields
     

Please enter text on the image