Combinatorial

Combean project is a Java framework for combinatorial structures like graphs or linear programs and optimization algorithms working with these structures. The objective of Combean is to integrate existing proven optimization packages as well as new implementations through a set of lean Java... Platforms: *nix

combina is a password generator that uses three different algorithms based on combinatorial analysis. It implements the permutation without repetition, permutation with repetition (the famous brute force), and combination without repetition. combina project supports an unlimited number of... Platforms: *nix

Algorithm::Combinatorics Perl module is an efficient generator of combinatorial sequences. SYNOPSIS use Algorithm::Combinatorics qw(permutations); my @data = qw(a b c); # scalar context gives an iterator my $iter = permutations(@data); while (my $p = $iter->next) { # ... } # list... Platforms: *nix

[FMAX,X] = KP01(W,P,C) solves the combinatorial optimization problem maximize F = SUM(P.*X), subject to SUM(W.*X) Platforms: Matlab

For each combinatorial type of convex 3-dimensional polyhedra, there exists a unique representative with the following properties: All edges are tangent to the unit sphere. The barycenter of the points where the edges touch the sphere is the origin. Koebe Polyhedron Editor is a Java application... Platforms: Windows

The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques. Platforms: Windows, Mac, BSD, Solaris, Linux

GloptiPoly is a MATLAB/SeDuMi add-on to build and solve convex linear matrix inequality (LMI) relaxations of the (generally non-convex) global optimization problem of minimizing a multivariablepolynomial function subject to polynomial inequality, equality or integer constraints.The software... Platforms: Matlab

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

How do you find the shortest path from one point to another in a computationally efficient way? The A* algorithm provides one implementation where the distance to the goal is considered as a heuristic in addition to local weightings, and the best path is recovered without combinatorial complexity. Platforms: Matlab

GLARE is a free software that facilitates and improves the design of chemical combinatorial libraries. This program reduces or eliminates the time a combinatorial chemist spends examining reagents which a priori cannot be part of a 'good library'. The principal objective of the algorithm behind... Platforms: *nix

Document clustering project is a data mining suite to cluster a document set. This set of tools was implemented from a series of papers: "Clustering Web Pages Semantically using Combinatorial Topology", "Data mining using granular computing", and "A fast association rule algorithm based on bitmap... Platforms: *nix

GMDR was built as an Open-Source interaction analysis instrument that is aimed to perform gene-gene interaction with generalized multifactor dimensionality methods. This Java-based tool offers a generalized combinatorial approach for detecting gene-by-gene and gene-by-environment interactions. Platforms: Windows, 2K, XP, Windows Vista, 7

Given a list, this script finds the indices used to get the elements from the list in sorted order. Platforms: Windows, Mac, *nix, Python, BSD Solaris

Arterial blood pressure waveforms contain rich pathophysiological information; hence receive much attention in cardiovascular health monitoring. To assist computerized analysis, an automatic delineator was proposed for the fiducial points of arterial blood pressure waveforms, namely their onsets,... Platforms: Matlab

It is desired for modern process systems to achieve optimal operation. However, operation at a pre-designed nominally optimal point may not necessarily be actually optimal due to realtime disturbances, measurement and control errors and uncertainties. Self-optimizing control aims to tackle this... Platforms: Matlab

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

New BoXplosion for Linux with cool 3D effects, bright colors and gripping gameplay! An arcade game on speed, combinatorial analysis and logic. The basic goal is to clear the field that is always being filled up by deleting three or more bricks that stand together. The game has an unlimited number... Platforms: *nix