[文献] A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite [推广有奖]

0关注
0粉丝

教授

45%

还不是VIP/贵宾

威望: 0 级
论坛币: 2 个
通用积分: 13.8454
学术水平: 2 点
热心指数: 2 点
信用等级: 2 点
经验: 2386 点
帖子: 712
精华: 0
在线时间: 516 小时
注册时间: 2010-2-15
最后登录: 2025-7-31

楼主

lzguo99 发表于 2013-2-18 10:14:26 |AI写论文

1论坛币

【作者(必填)】Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

【文题(必填)】A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

【年份(必填)】2007

【全文链接或数据库名称(选填)】http://link.springer.com/chapter ... -72792-7_23?LI=true

Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science Volume 4513, 2007, pp 295-309

最佳答案

jigesi 查看完整内容

A Branch and Bound Algorithm for MaA Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxationsx-Cut Based on Combining Semidefinite and Polyhedral Relaxations

分享0 收藏0 回帖

关键词：combining Algorithm definite branch finite 数据库 3986 轴承

回帖推荐

jigesi 发表于2楼查看完整内容

A Branch and Bound Algorithm for MaA Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxationsx-Cut Based on Combining Semidefinite and Polyhedral Relaxations

sat(n, C6)

沙发

jigesi 发表于 2013-2-18 10:14:27

A Branch and Bound Algorithm for MaA Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxationsx-Cut Based on Combining Semidefinite and Polyhedral Relaxations

附件: 你需要登录才可以下载或查看附件。没有帐号？我要注册 