The greedy algorithm as a combinatorial principle.
Faigle, Ulrich (1981)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Displaying similar documents to “An iterative algorithm for computing the cycle mean of a Toeplitz matrix in special form”
The greedy algorithm as a combinatorial principle.
An analogue of Jeu de taquin for Littelmann's crystal paths.
van Leeuwen, Marc A.A. (1998)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On the diophantine equation
K. Győry (1998)
Acta Arithmetica
Similarity:
Local integrating factors.
Walcher, Sebastian (2003)
Journal of Lie Theory
Similarity:
Cycle peaks and partial derivatives. (Pics de cycles et dérivés partielles.)
Dumont, Dominique (1985)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
CR submanifolds of maximal CR dimension in complex projective space and its holomorphic sectional curvature
Mirjana Đorić (2003)
Kragujevac Journal of Mathematics
Similarity:
Compositional inversion of triangular sets of series.
Barnabei, Marilena (1984)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Groups of strings.
Wojtyński, Wojciech (2003)
Journal of Lie Theory
Similarity:
A new regular multiplier embedding
Gemayqzel Bouza Allende, Jürgen Guddat (2013)
Kybernetika
Similarity:
Embedding approaches can be used for solving non linear programs P. The idea is to define a one-parametric problem such that for some value of the parameter the corresponding problem is equivalent to P. A particular case is the multipliers embedding, where the solutions of the corresponding parametric problem can be interpreted as the points computed by the multipliers method on P. However, in the known cases, either path-following methods can not be applied or the necessary conditions...
Graphical major indices. II.
Foata, Dominique, Krattenthaler, Christian (1995)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: