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

Randomized algorithms in combinatorial optimization: A survey

โœ Scribed by Francesco Maffioli

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
633 KB
Volume
14
Category
Article
ISSN
0166-218X

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

Critical phenomena in a collective compu
Critical phenomena in a collective computation algorithm for combinatorial optimization problems
โœ T. Fukao; J. Wu; K. Ikeda ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 398 KB

This paper discusses the critical temperature (control parameter) of an annealed neural network, a typical collective computation for combinatorial optimization problems. It is shown that the theoretical critical temperatures determined by our estimation agree with those derived by computational ex