Code Directory
 Visual Basic & VB.NET
New Code
Dynamics CRM Inventory Manager Plugin 1.0
Overstock Script 1.0.3
AnyGantt JS Gantt Charts 8.2.0
SentiVeillance SDK Trial 6.0.176566
Popup extension for Magento 2 2.2.x
Excel Add-in for Shopify 1.7
PHP Classified Script 1.0.3
Popup For Magento 2 2.2.x
Desktop Live Streaming SDK - Screen2Video Gold ActiveX 5.2
ODBC Driver for PostgreSQL 2.3
WooCommerce Product Customizations 1.0
Apartment Rental Software 1.0.3 1.1
Order ODBC Driver for MySQL 2.3
Top Code
Dynamics CRM Inventory Manager Plugin 1.0
Fast and efficient spectral clustering 1.0
PHP Classified Script 1.0.4
Online Poker Script 1.0
MLM Software ONE 1.5.46
Human Resource Management CRM 1
PHP Competition System 1.0
Easynews PHP for Scripts 1.7.1
Berkeley Wavelet Transform 1.0
NES Rom Maker 1.0
T-Shirt Designer Script 1.65
Simplified Fuzzy ARTMAP Neural Network 1.0
Overstock Script 1.0.3
Get Random Record Based on Weight 1.0.0
Top Rated
Output Messenger 1.8.0
Aliexpress Clone- Ec21 Script 1
Indiegogo Clone 3.0
PHP Image Resize Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Deals and Discounts Website Script 1.0.2
Readymade MLM Products 2.01
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem 1.0
File ID: 78528

LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem 1.0
Download LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 186
User Rating:4 Stars  (1 rating)
Submit Rating:
LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem 1.0 Description
Description: The Jonker-Volgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm. It is about 10 times faster than the munkres code (v2.2) of the author. It can solve a 1000 x 1000 problem in about 3 seconds in a normal Intel Centrino processor.

V1.1 returns the dual variables and the reduced cost matrix as well.
V1.2 can deal with nonsquare assignment problems.
V2.0 is faster for problems with a large range of costs.
V2.1 includes an option to change the cost resolution to improve performance for some problems.
v2.2 removes a small bug to avoid NAN for 1x1 case.
v2.3 removes a small bug to handle a cost matrix with all inf's.
v2.4 fixes a bug associated with resolution to address the known problem of the algorithm.
R. Jonker and A. Volgenant, "A shortest augmenting path algorithm for dense and spare linear assignment problems", Computing, Vol. 38, pp. 325-340, 1987.

License: Freeware

Related: about 10, Address, Algorithm, 38 pp, times, Problem, casev, and the, wellv, assignment problem, spare, option, algorithmreferencer jonker, inf, nonsquare assignment, munkres code

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

File Size: 10.0 KB

Downloads: 186

More Similar Code

This function contains the well known greedy algorithm for solving Set Cover problem (ChvdodAtal, 1979), with two small modifications:
* In case of more than one possible choice at a certain step, the biggest set is chosen;
* Once the solution is found, we check the selected sets to find a better cover solution, removing a set if is a subset of the union of the other set.

If you use this code, please cite the article for...

With this package, I provide some MATLAB-functions regarding the rectangular assignment problem. This problem appears for example in tracking applications, where one has M existing tracks and N new measurements. For each possible assignment, a...

Solves the linear least squares problem with nonnegative variables using the newton's algorithm in:
Portugal, Judice and Vicente, A comparison of block pivoting and interior point algorithms for linear least squares problems with nonnegative...

findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).
An independent set of a graph is a subset of vertices in which no two vertices are
adjacent. Given a set of vertices, the maximum independent set...

Functions related to the assignment problem. Main functions: hungarian - calculate a solution of the square assignment problem. See HELP for a reference.

Multilayer Perceptron Neural Network Model and Backpropagation Algorithm for Simulink.
Multilayer Perceptron Neural Network Model and Backpropagation Algorithm for Simulink.

Marcelo Augusto Costa Fernandes

A simple and fast algorithm for generating doubly-stochasstic matrices.
(matrices, where the sum of each column and each row is exactly 1).
Each matrix is chosen uniformly from the space of all NxN doubly-stochasstic

Vibterbi algorithm for HMM inference
Viterbi algorithm based on the Python code found at:

Also included is an example based on the one from the Wikipedia page.

The code is...

3D reconstruction algorithm for electron cryo-microscopy
Traditional single particle reconstruction methods use either the Fourier or the delta function basis to represent the particle density map. We propose a more flexible algorithm that...

The Radial Basis Function (RBF) with LMS algorithm for Simulink.
The Radial Basis Function (RBF)
Batch-mode training
Fixed centers selected at random
The Gaussian basis functions
Computing the output weights with LMS...

User Review for LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem
- required fields

Please enter text on the image