A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

A group of researchers at the Massachusetts Institute of Technology have devised a potentially more effective way of helping computers solve some of the toughest optimization problems they face. Their ...

FSNet is a new problem-solving tool that can find the optimal solution to an extremely complex problem without violating any of the problem’s many constraints. Developed at MIT, FSNet could help power ...

This paper deals with the nonlinear complementarity problem on the product space of unit simplices, S. A simplicial variable dimension algorithm developed by van der Laan and Talman for proper ...

University of Nottingham provides funding as a founding partner of The Conversation UK. Take a set of chess pieces and throw them all away except for one knight. Place the knight on any one of the 64 ...