๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A relative difference quotient algorithm for discrete optimization

โœ Scribed by S. Chai; H. C. Sun

Publisher
Springer-Verlag
Year
1996
Tongue
English
Weight
901 KB
Volume
12
Category
Article
ISSN
1615-1488

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A combinatorial algorithm for the discre
A combinatorial algorithm for the discrete optimization of structures
โœ Chai Shan; Sun Huanchun ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Springer ๐ŸŒ English โš– 599 KB

The definition of local optimum solution of the discrete optimi:ation is first given, and then a comprehensive combinatorial algorithm is proposed in this paper. Two-level optimum method is used in the algorithm. In the first ieve optimkaiion, un approximate locai optimum solution x is found by usi

A nilpotent quotient algorithm for grade
A nilpotent quotient algorithm for graded Lie rings
โœ George Havas; M.F. Newman; M.R. Vaughan-Lee ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 815 KB

A nilpotent quotient algorithm for graded Lie rings of prime characteristic is described. The algorithm has been implemented and applications have been made to the investigation of the associated Lie rings of Burnside groups. New results about Lie rings and Burnside groups are presented. These inclu