𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A discrete dynamic convexized method for the max-cut problem

✍ Scribed by Geng Lin, Wenxing Zhu

Book ID
113060849
Publisher
Springer US
Year
2012
Tongue
English
Weight
623 KB
Volume
196
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A discrete dynamic convexized method for
A discrete dynamic convexized method for nonlinear integer programming
✍ Wenxing Zhu; Hong Fan πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 820 KB

In this paper, we consider the box constrained nonlinear integer programming problem. We present an auxiliary function, which has the same discrete global minimizers as the problem. The minimization of the function using a discrete local search method can escape successfully from previously converge

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