A new algorithm for the three counterfeit coins problem.

Bošnjak, Ivica

Displaying similar documents to “A new algorithm for the three counterfeit coins problem.”

Algorithm 45. A heuristic algorithm for the traveling-salesman problem

A. Adrabiński (1976)

Applicationes Mathematicae

Similarity:

Algorithm 12. Minimum of a function of one variable

Z. Cylkowski (1971)

Applicationes Mathematicae

Similarity:

Algorithm 30. The calculation of the minimum of a certain function of one variable

E. Neuman (1974)

Applicationes Mathematicae

Similarity:

Algorithm 24. One-dimensional knapsack function

J. Kucharczyk (1973)

Applicationes Mathematicae

Similarity:

Algorithm 61. The solution of a certain linear equation system

Z. Kasperski (1978)

Applicationes Mathematicae

Similarity:

Algorithm 8. A program to shorten a sequence of sets of integer numbers

Krystyna Jerzykiewicz (1970)

Applicationes Mathematicae

Similarity:

Algorithm 49. An algorithm for solving the machine sequencing problem

A. Adrabiński, J. Grabowski (1977)

Applicationes Mathematicae

Similarity:

Remarks on algorithm 3

Z. Cylkowski, J. Kucharczyk (1970)

Applicationes Mathematicae

Similarity:

Remarks on algorithm 32

Anna Bartkowiak (1975)

Applicationes Mathematicae

Similarity:

Algorithm 37. Solution of sparse linear equation systems

F. Pankowski (1974)

Applicationes Mathematicae

Similarity:

Algorithm 16. Implicit enumeration algorithm for solving zero-one integer programs

J. Kucharczyk (1972)

Applicationes Mathematicae

Similarity:

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

Algorithm 31. The calculation of the minimum of a certain function of several variables

E. Neuman (1974)

Applicationes Mathematicae

Similarity: