期刊
INFORMS JOURNAL ON COMPUTING
卷 21, 期 2, 页码 304-313出版社
INFORMS
DOI: 10.1287/ijoc.1080.0293
关键词
mixed-integer programming (MIP); MIPLIB 2003; software for MIP
Despite the fact that no polynomial-time algorithm is known for solving mixed-integer programming (MIP) problems, there has been remarkable success in recent years in solving a wide range of difficult MIPs. In this paper, we take a look at some of the hardest problems in the MIPLIB 2003 test set and show how Xpress-MP can be used to solve some of the problems that were previously thought to be intractable.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据