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

A new discrete filled function method for solving large scale max-cut problems

โœ Scribed by Ai-fan Ling, Cheng-xian Xu

Book ID
113077356
Publisher
Springer US
Year
2011
Tongue
English
Weight
482 KB
Volume
60
Category
Article
ISSN
1017-1398

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A discrete filled function algorithm for
A discrete filled function algorithm for approximate global solutions of max-cut problems
โœ Ai-Fan Ling; Cheng-Xian Xu; Feng-Min Xu ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 245 KB

A discrete filled function algorithm is proposed for approximate global solutions of max-cut problems. A new discrete filled function is defined for max-cut problems and the properties of the filled function are studied. Unlike general filled function methods, using the characteristic of max-cut pro