Assignment Problem
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 |
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 |
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 |
Functions related to the assignment problem. Main functions: hungarian - calculate a solution of the square assignment problem. See HELP for a reference.
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (43): assignprob.zip Download |
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 |
"Hungarian algorithm" to solve the square assignment problem (original & pure MATLAB implementation). The Hungarian algorithm can also be used as a sub-solver in a B&B solver for the travelling salesman problem.How to match N (e.g. N=6) pairs of signals from 2 experiments? Build full reordering...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (40): bghungar Download |
#D7CX: I pledge that Language assignment will have a full Drupal 7 release on the day that Drupal 7 is released.Language assignment lets you set the language of multiple nodes or users at a time.To use it, go to the bulk node update form (admin/content/node) or bulk user update form...
Platforms: PHP
License: Freeware | Size: 10 KB | Download (51): Language assignment Download |
Modern day Windows computers are very complex but unfortunately far from perfect. Over time with the installation and removal of games, programs, software and hardware your computer can experience windows problems.
Windows problems can make your computer perform very slowly. This can be on...
Platforms: Windows
License: Freeware | Size: 905.27 KB | Download (231): Windows Problem Download |
Laptops which use dynamic IP address assignment via DHCP have the problem that the boot process is much longer when no wire is connected to the Ethernet card. This is because the startup scripts have to wait for the DHCP request to time out. ethwireck can detect if the physical layer of the...
Platforms: *nix
License: Freeware | Size: 48.13 KB | Download (96): Ethwireck Download |
A Lambert-orbital boundary value problem can be stated as"Find the orbit/trajectory of a spacecraft that flies from position [r1] to [r2], taking a time [tf] and making [m] complete orbits before arriving at [r2]. "The solution to each Lambert-problem is NOT unique; one can travel to [r2] via the...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (46): Robust solver for Lambert's orbital-boundary value 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 |
This is a program that generates a test problem for linear optimization with a sparse matrix. The test problem is of the kindmin c'*xs.t. Aeq*x=beq lb
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (39): Test problem LP Download |
A STRIPS problem is a planning problem that views the world as a set of variables and actions upon them. A problem is solved when a series of actions can be found that will lead to a Goal assignment of values to variables from a Start assignment. The STRIPS to CSP converter allows for the...
Platforms: Mac
License: Freeware | Size: 552.96 KB | Download (37): STRIPS to CSP Converter Download |
RECORDS is a FREE, multi-user, problem oriented, database and word processing report writer, optimized for data entry using voice recognition, and designed for medical care. Enter and maintain clients and their demographics, create new or update past problems of a client, edit multiple...
Platforms: Windows
License: Freeware | Size: 4.02 MB | Download (609): Problem Oriented Records - Tobis Paperless Office Download |
Records is a FREE, multi-user, problem oriented, word processor and database, designed for medical care. It is optimized for data entry using a speech recognition system, like Dragon. Enter clients and their demographics, multiple problems for a client, sectioned descriptions of each problem, and...
Platforms: Windows
License: Freeware | Size: 4.1 MB | Download (579): Problem Oriented Records Download |
Assignment Collector/Grader (what a mouthful!) was conceived in 2010 as a way to reduce the workload of an over-worked professor teaching a CS data structures class. It proved not only to reduce the grading workload, but also improved the lab completion rates among students, and grades overall...
Platforms: Windows, Mac, Linux
License: Freeware | Size: 1014.12 KB | Download (50): Assignment Collector/Grader Download |
simulatedannealing() is an optimization routine for traveling salesman problem. Any dataset from the TSPLIB can be suitably modified and can be used with this routine. A detailed description about the function is included in "Simulated_Annealing_Support_Document.pdf."A GUI is used with the core...
Platforms: Matlab
License: Freeware | Size: 512 KB | Download (49): Traveling Salesman Problem (TSP) using Simulated Annealing Download |
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...
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (41): Greedy algorithm for Set Cover problem 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 |
This is an application of the Greedy Algorithm and the Local Search for finding a solution for the SC Distribution Network problem.We dealt with one level SC composed of a set of factories and a set of Sales Points, each sales point has a demand at a certain time, each factory has a production...
Platforms: Matlab
License: Freeware | Size: 583.68 KB | Download (52): Applying Greedy Algorithm and Local Search in a Supply Chain distribution problem Download |