Search Results for "combinatorial"

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.

JaCoP is a Java Constraint Programming solver. It provides a significant number of (global) constraints to facilitate efficient modeling of combinatorial problems, as well as modular design of search. Documentation is available at project Web site. Please, note that the sources from version 4.0 are only available at GitHub.

OptFrame is a framework for efficient implementation of metaheuristics and optimization methods. It has already been used in some real combinatorial problems and applied to Operations Research. Since November 2017, project has been moved to GitHub (new releases will also be included here in SourceForge, but Git mainline is no longer supported here). For more information, visit: https://github.com/OptFrame/optframe

Originally developped to handle PacBio CCS data for an AAV capsid library. This program will extract, correct, translate and analyze the sequencng data, starting from the CCS fastq file.

Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.

RaTrav tool was designed to support computational biology studies where mean first-passage times (MFPTs) between initial and single or multiple final states in network-like systems are used. The tool approves arbitrary networks (graphs) where a dynamics of the Markovian type takes place. Two methods are made available for which their efficiency is strongly dependent on the topology of the defined network: the combinatorial Hill technique and the Monte Carlo simulation method. References: M...

A Constraint-Based Local Search solver for the Water Retention on Magic Squares-problem. The problem is a very hard combinatorial optimisation problem, invented by Craig Knecht. More can be read about it at: http://en.wikipedia.org/wiki/Water_retention_on_mathematical_surfaces Craig's website for the problem: http://www.knechtmagicsquare.paulscomputing.com/ The solver is mainly based on the theory and ideas from my bachelor thesis, which I wrote at Uppsala University, Sweden...

The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.

ConGENER package is a set of combinatorial-computational tools to study families of halogen substituted molecules, so called congeners.

GLARE is a library and a software for product based optimization of reagent lists in the context of a chemical combinatorial library design. Large virtual combinatorial libraries containing 10^12 products have been optimized within a second.

Portable C++ library intended to help explore the combinatorial properties of knots.

Generating combinatorial objects: exponents, all exponents, permutations, color permutations, arrangements, combinations for any numbers and words.

Implement Robin Hanson's "simple combinatorial information market maker", specifically for rapid and reliable solution of "knights and knaves" puzzles. This toy domain makes development easier, and the scope can be expanded later.

GAP (Groups, Algorithms, and Programming) is a free computer algebra system which is well-suited for algebraic and combinatorial systems. CWADS is a GAP share package to add functionality for Cwatsets, a relatively new field of mathematics.