Munkres Algorithm
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.There are a few submissions in the File Exchange for the...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (40): Munkres Assignment Algorithm Download |
This is an extremely fast implementation of the famous Hungarian algorithm (aslo known as Munkres' algorithm). The new version (V2.2)is about 1.5 times faster than the old version (V2.1). It can solve a 1000 x 1000 problem in about 20 seconds in a Core Duo (T2500 @ 2.00GHz) XP laptop with Matlab...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (45): Hungarian Algorithm for Linear Assignment Problems (V2.2) Download |
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 cost or distance is computed. All cost values form a...
Platforms: Matlab
License: Freeware | Size: 20.48 KB | Download (50): Functions for the rectangular assignment problem Download |
auction_match: Compute optimal (maximal) weighted assignment and the corresponding "lattice of dual prices" supporting the optimal assignment. auction_match(disMatrix) computes the optimal assignment for the given rectangular value matrix, for example the assignment of bidders (in rows) to...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (40): Rectangular maximal assignment with lattice of dual price Download |
Algorithm::Munkres is a Perl extension for Munkres solution to classical Assignment problem for square and rectangular matrices. This module extends the solution of Assignment problem for square matrices to rectangular matrices by padding zeros. Thus a rectangular matrix is converted to square...
Platforms: *nix
License: Freeware | Size: 9.22 KB | Download (100): Algorithm::Munkres Download |
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...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (55): LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem Download |
Algorithm::Dependency is a base class for implementing various dependency trees. SYNOPSIS use Algorithm::Dependency; use Algorithm::Dependency::Source::File; # Load the data from a simple text file my $data_source = Algorithm::Dependency::Source::File->new( foo.txt ); # Create the...
Platforms: *nix
License: Freeware | Size: 46.08 KB | Download (121): Algorithm::Dependency Download |
Algorithm::Knapsack is a brute-force algorithm for the knapsack problem. SYNOPSIS use Algorithm::Knapsack; my $knapsack = Algorithm::Knapsack->new( capacity => $capacity, weights => @weights, ); $knapsack->compute(); foreach my $solution ($knapsack->solutions()) { foreach my $index...
Platforms: *nix
License: Freeware | Size: 4.1 KB | Download (203): Algorithm::Knapsack Download |
Algorithm::DiffOld is a Perl module to compute `intelligent differences between two files / lists but use the old (<=0.59) interface. NOTE This has been provided as part of the Algorithm::Diff package by Ned Konz. This particular module is ONLY for people who HAVE to have the old interface,...
Platforms: *nix
License: Freeware | Size: 23.55 KB | Download (95): Algorithm::DiffOld Download |
Algorithm::Loops is a Perl module with looping constructs: NestedLoops, MapCar*, Filter, and NextPermute*. SYNOPSYS use Algorithm::Loops qw( Filter MapCar MapCarU MapCarE MapCarMin NextPermute NextPermuteNum NestedLoops ); my @copy= Filter {tr/A-Z.,"()/a-z/d} @list; my $string= Filter...
Platforms: *nix
License: Freeware | Size: 22.53 KB | Download (108): Algorithm::Loops Download |
Algorithm::Diff::Apply is a Perl module to apply one or more Algorithm::Diff diffs. SYNOPSIS ## Single-diff form: use Algorithm::Diff::Apply qw{apply_diff}; my @ary = ...; my @diff = ...; # some call to Algorithm::Diff::diff() my @changed_ary = apply_diff(@ary, @diff); my $changed_ary =...
Platforms: *nix
License: Freeware | Size: 12.29 KB | Download (92): Algorithm::Diff::Apply Download |
Parallel Genetic Algorithm Library (or PGAL for short) is a C++ toolkit for simply, efficiently, and swiftly producing genetic algorithm code that works across multiple processors. This is useful not only for those with multi-processor computers, but also for distributed and cluster computing...
Platforms: *nix
License: Freeware | Size: 75.78 KB | Download (214): Parallel Genetic Algorithm Library Download |
Algorithm::BinPack is a Perl module that can efficiently pack items into bins. SYNOPSIS Algorithm::BinPack efficiently packs items into bins. The bins are given a maximum size, and items are packed in with as little empty space as possible. An example use would be backing up files to CD,...
Platforms: *nix
License: Freeware | Size: 4.1 KB | Download (101): Algorithm::BinPack Download |
Genetic Algorithm File Fitter, or just GAFFitter, is a command-line software written in C++ that arranges--via a genetic algorithm--an input list of items or files/directories into volumes of a certain capacity (target), such as CD or DVD, in a way that the total wastage is minimized. By smartly...
Platforms: *nix
License: Freeware | Size: 40.96 KB | Download (122): Genetic Algorithm File Fitter Download |
Algorithm::Permute is a Perl module with handy and fast permutation with object oriented interface. SYNOPSIS use Algorithm::Permute; my $p = new Algorithm::Permute([a..d]); while (@res = $p->next) { print join(", ", @res), "n"; } my @array = (1..9); Algorithm::Permute::permute { print...
Platforms: *nix
License: Freeware | Size: 10.24 KB | Download (102): Algorithm::Permute Download |
Algorithm::SISort is a Perl module that contains select and insert sorting algorithm. SYNOPSIS use Algorithm::SISort qw(Sort Sort_inplace); @sorted_list = Sort {$_[0] <=> $_[1]} @unsorted_list; # ... or ... $number_of_comparisons = Sort_inplace {$_[0] <=> $_[1]} @unsorted_list; This...
Platforms: *nix
License: Freeware | Size: 4.1 KB | Download (100): Algorithm::SISort Download |
Algorithm::Merge is a Perl module package that provides three-way merge and diff. SYNOPSIS use Algorithm::Merge qw(merge diff3 traverse_sequences3); @merged = merge(@ancestor, @a, @b, { CONFLICT => sub { } }); @merged = merge(@ancestor, @a, @b, { CONFLICT => sub { } },...
Platforms: *nix
License: Freeware | Size: 10.24 KB | Download (92): Algorithm::Merge Download |
Algorithm::Huffman is a Perl extension that implements the Huffman algorithm. SYNOPSIS use Algorithm::Huffman; my %char_counting = map {$_ => int rand(100)} (a .. z, A .. Z); # or better the real counting for your characters # as the huffman algorithm doesnt work good with random data...
Platforms: *nix
License: Freeware | Size: 8.19 KB | Download (110): Algorithm::Huffman Download |
Optimization Algorithm Toolkit is a workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more. The project...
Platforms: *nix
License: Freeware | Size: 6.5 MB | Download (123): Optimization Algorithm Toolkit Download |
Algorithm::Networksort can create inline comparisons for sorting. SYNOPSIS use Algorithm::Networksort qw(:all); my $inputs = 4; # # Generate the network (a list of comparators). # my @network = nw_comparators($inputs); # # Print the list, and print the graph of the list. # print...
Platforms: *nix
License: Freeware | Size: 15.36 KB | Download (89): Algorithm::Networksort Download |