Algorithm 12. Minimum of a function of one variable
Z. Cylkowski (1971)
Applicationes Mathematicae
Similarity:
Displaying similar documents to “Algorithm 30. The calculation of the minimum of a certain function of one variable”
Algorithm 12. Minimum of a function of one variable
Algorithm 31. The calculation of the minimum of a certain function of several variables
E. Neuman (1974)
Applicationes Mathematicae
Similarity:
Algorithm 24. One-dimensional knapsack function
J. Kucharczyk (1973)
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 45. A heuristic algorithm for the traveling-salesman problem
A. Adrabiński (1976)
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:
Algorithm 16. Implicit enumeration algorithm for solving zero-one integer programs
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity:
Algorithm 29. Solving systems of linear equations by Sokolov's method
S. Lewanowicz (1974)
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 37. Solution of sparse linear equation systems
F. Pankowski (1974)
Applicationes Mathematicae
Similarity:
Algorithm 38. Calculation of all marginal means from an n-way table
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Extending the MAX Algorithm for Maximum Independent Set
Ngoc C. Lê, Christoph Brause, Ingo Schiermeyer (2015)
Discussiones Mathematicae Graph Theory
Similarity:
The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set of G. We also describe two modifications of Algorithm MAX and sets of forbidden induced subgraphs for the new algorithms.