Algorithm 16. Implicit enumeration algorithm for solving zero-one integer programs
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity:
Displaying similar documents to “An extension of Miller's algorithm”
Algorithm 16. Implicit enumeration algorithm for solving zero-one integer programs
Algorithm 38. Calculation of all marginal means from an n-way table
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Algorithm 29. Solving systems of linear equations by Sokolov's method
S. Lewanowicz (1974)
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 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 24. One-dimensional knapsack function
J. Kucharczyk (1973)
Applicationes Mathematicae
Similarity:
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
A. Adrabiński (1976)
Applicationes Mathematicae
Similarity:
Algorithm 30. The calculation of the minimum of a certain function of one variable
E. Neuman (1974)
Applicationes Mathematicae
Similarity:
Measuring and maintaining consistency: a hybrid FTF algorithm
James Bunch, Richard Le Borne, Ian Proudler (2001)
International Journal of Applied Mathematics and Computer Science
Similarity:
Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because of its undesirable tendency to diverge when operating in finite precision arithmetic. To compensate, modifications to the algorithm have been introduced that are either occasional (performed when a predefined condition(s) is violated) or structured as part of the normal update iteration. However,...
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.