Algorithm 16. Implicit enumeration algorithm for solving zero-one integer programs
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity:
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
S. Lewanowicz (1974)
Applicationes Mathematicae
Similarity:
A. Adrabiński, J. Grabowski (1977)
Applicationes Mathematicae
Similarity:
Z. Cylkowski, J. Kucharczyk (1970)
Applicationes Mathematicae
Similarity:
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Z. Kasperski (1978)
Applicationes Mathematicae
Similarity:
Krystyna Jerzykiewicz (1970)
Applicationes Mathematicae
Similarity:
J. Kucharczyk (1973)
Applicationes Mathematicae
Similarity:
A. Adrabiński (1976)
Applicationes Mathematicae
Similarity:
E. Neuman (1974)
Applicationes Mathematicae
Similarity:
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,...