Results 1 to 10 of about 790 (89)
International Journal of Mathematics and Mathematical Sciences, Volume 26, Issue 10, Page 581-588, 2001., 2001 Antichains of a finite bounded poset are assigned antichains playing a role analogous to that played by blockers in the Boolean lattice of all subsets of a finite set. Some properties of lattices of generalized blockers are discussed.
Andrey O. Matveev
wiley +3 more sources
Search Algorithms for a System of Different Representatives of Subsets of a Finite Set
Journal of Economics and Management Sciences, 2023 The paper considers various aspects and approaches regarding the search for a system of differenrt representatives (SDR) of subsets of a finite set. Algorithm 3 has been developed, which is an algorithmization of the search process for SDR on the basis ...
D. Terzi
semanticscholar +1 more source
Evolution of group-theoretic cryptology attacks using hyper-heuristics
Journal of Mathematical Cryptology, 2021 In previous work, we developed a single evolutionary algorithm (EA) to solve random instances of the Anshel–Anshel–Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings.
Craven Matthew J., Woodward John R.
doaj +1 more source
Decomposing tournaments into paths
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
A new conjugate gradient method for acceleration of gradient descent algorithms
Moroccan Journal of Pure and Applied Analysis, 2021 An accelerated of the steepest descent method for solving unconstrained optimization problems is presented. which propose a fundamentally different conjugate gradient method, in which the well-known parameter βk is computed by an new formula.
Rahali Noureddine +2 more
doaj +1 more source
The polytope of all triangulations of a point configuration
Documenta Mathematica, 1996 We study the convex hull P A of the 0-1 incidence vectors of all triangulations of a point con guration A. This was called the universal polytope in [4]. The a ne span of P A is described in terms of the cocircuits of the oriented matroid of A.
J. D. Loera +3 more
semanticscholar +1 more source
Extended blocker, deletion, and contraction maps on antichains
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 10, Page 607-616, 2003., 2003 Families of maps on the lattice of all antichains of a finite bounded poset that extend the blocker, deletion, and contraction maps on clutters are considered. Influence of the parameters of the maps is investigated. Order‐theoretic extensions of some principal relations for the set‐theoretic blocker, deletion, and contraction maps on clutters are ...
Andrey O. Matveev
wiley +1 more source
MINIMUM COST NETWORK FLOWS: PROBLEMS, ALGORITHMS, AND SOFTWARE
, 2013 : We present a wide range of problems concerning minimum cost network flows, and give an overview of the classic linear single-commodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems, either tractable or intractable ...
Angelo Sifaleras
semanticscholar +1 more source
A note on operators of deletion and contraction for antichains
International Journal of Mathematics and Mathematical Sciences, Volume 31, Issue 12, Page 725-729, 2002., 2002 The operators of deletion and contraction for clutters are generalized to those for antichains of finite bounded posets. A generalization of the result by Seymour (1976), describing the relationship between the operators of deletion, contraction, and the blocker map, is considered as a comparison in the lattice of antichains of a poset.
Andrey O. Matveev
wiley +1 more source
AN ANNOTATED BIBLIOGRAPHY OF COMBINED ROUTING AND LOADING PROBLEMS
, 2013 : Transportation problems involving routing and loading at the same time are currently a hot topic in combinatorial optimization. The interest of researchers and practitioners is motivated by the intrinsic difficulty of this research area, which combines
M. Iori, S. Martello
semanticscholar +1 more source