23 octubre 2015
Computer programmers have developed a new ‘cutting-plane’ algorithm, a general-purpose algorithm for solving optimization problems. The algorithm improves on the running time of its most efficient predecessor, and the researchers offer some reason to think that they may have reached the theoretical limit.
http://www.sciencedaily.com/releases/2015/10/151023121847.htm
