期刊
JOURNAL OF HEURISTICS
卷 19, 期 4, 页码 565-571出版社
SPRINGER
DOI: 10.1007/s10732-011-9189-8
关键词
Max Cut problem; Metaheuristics; Combinatorial optimization
In recent years many algorithms have been proposed in the literature for solving the Max-Cut problem. In this paper we report on the application of a new Tabu Search algorithm to large scale Max-cut test problems. Our method provides best known solutions for many well-known test problems of size up to 10,000 variables, although it is designed for the general unconstrained quadratic binary program (UBQP), and is not specialized in any way for the Max-Cut problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据