Journal
INFORMS JOURNAL ON COMPUTING
Volume 21, Issue 2, Pages 304-313Publisher
INFORMS
DOI: 10.1287/ijoc.1080.0293
Keywords
mixed-integer programming (MIP); MIPLIB 2003; software for MIP
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available