The following Matlab project contains the source code and Matlab examples used for lzw compression algorithm. This is a simple implementation of the famous LZW algorithm.

The following Matlab project contains the source code and Matlab examples used for kruskal algorithm. Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected un directed weighted graph The zip file contains kruskal.

The following Matlab project contains the source code and Matlab examples used for munkres assignment algorithm. Munkres algorithm (also known as Hungarian algorithm) is an efficient algorithm to solve the assignment problem in polynomial-time.

The following Matlab project contains the source code and Matlab examples used for implementation of bertsekas' auction algorithm to solve the assignment problem . This function uses the auction principle to return the optimal assignment and the dual prices.

The following Matlab project contains the source code and Matlab examples used for discrete walsh transform algorithm. computes the discrete walsh transform

The following Matlab project contains the source code and Matlab examples used for alghorithm of karge thompson. The algorithm of Karge Thompson is a heuristic algorithm that allows to obtain, given a specific group of jobs to be produced, the best sequence in terms of time setup.

The following Matlab project contains the source code and Matlab examples used for is there an algorithm to use the max numbers of coins in your pocket? . How do you choose the coins in your pocket to pay something? Is there an algorithm to use the max numbers of coins? Of course there is as shown in the book "L'algoritmo del parcheggio" (the parking algorithm) by Prof.

The following Matlab project contains the source code and Matlab examples used for heuristic algorithm for finding maximum independent set. findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).

The following Matlab project contains the source code and Matlab examples used for greedy algorithm for set cover problem. This function contains the well known greedy algorithm for solving Set Cover problem (Chvátal, 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.

The following Matlab project contains the source code and Matlab examples used for pattern search method deterministic iterative zero order algorithm. It's a deterministic iterative zero order algorithm that can be used to solve unconstrained optimization problem.

The following Matlab project contains the source code and Matlab examples used for hungarian algorithm for linear assignment problems (v2.3). This is an extremely fast implementation of the famous Hungarian algorithm (aslo known as Munkres' algorithm).

The following Matlab project contains the source code and Matlab examples used for the k limaps algorithm. A a new algorithm to solve the sparse approximation problem over redundant dictionaries based on LiMapS, where the input signal is restricted to be a linear combination of k atoms from a fixed dictionary.

The following Matlab project contains the source code and Matlab examples used for dijkstra algorithm. This algorithm is to solve shortest path problem.