Solving Previously Unsolved Optimization Problems

Mixed-integer programming (MIP) problem is arguably among the hardest classes of optimization problems. This paper describes how  21 previously unsolved MIP instances were solved using up to 80,000 cores in parallel on the Titan supercomputer. Link

This entry was posted in Decision Optimization. Bookmark the permalink.

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s