BACKTRACK_BINARY_RC
Binary Backtrack Search Using Reverse Communication


BACKTRACK_BINARY_RC is a Python library which carries out a backtrack search for a set of binary decisions, using reverse communication (RC).

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages:

BACKTRACK_BINARY_RC is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.

Related Data and Programs:

BISECTION_RC, a Python library which seeks a solution to the equation F(X)=0 using bisection within a user-supplied change of sign interval [A,B]. The procedure is written using reverse communication (RC).

CG_RC, a Python library which implements the conjugate gradient method for solving a positive definite sparse linear system A*x=b, using reverse communication (RC).

LOCAL_MIN_RC, a Python library which finds a local minimum of a scalar function of a scalar variable, without the use of derivative information, using reverse communication (RC), by Richard Brent.

ROOT_RC, a Python library which seeks a solution of a scalar nonlinear equation f(x) = 0, or a system of nonlinear equations, using reverse communication (RC), by Gaston Gonnet.

ROOTS_RC, a Python library which seeks a solution of a system of nonlinear equations f(x) = 0, using reverse communication (RC), by Gaston Gonnet.

SORT_RC, a Python library which can sort a list of any kind of objects, using reverse communication (RC).

SUBSET, a Python library which enumerates, generates, randomizes, ranks and unranks combinatorial objects including combinations, compositions, Gray codes, index sets, partitions, permutations, polynomials, subsets, and Young tables. Backtracking routines are included to solve some combinatorial problems.

ZERO_RC, a Python library which seeks a solution of a scalar nonlinear equation f(x) = 0, using reverse communication (RC), by Richard Brent.

Source Code:

You can go up one level to the Python source codes.


Last revised on 31 December 2013.