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.

Scientists say using math to sort through DNA could help investigators put stubborn cold cases to rest. The approach combines the relatively new field of forensic genetic genealogy—solving crime by ...

Dave Johnson refuses to eat fish farmed near Minneapolis. The retired construction worker, who lives in a rural area 150 miles north of the Twin Cities, claims “tourists’ garbage, salt runoff and ...

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 ...

We’ve mastered the Rubik’s Cube. By we, though, I don’t necessarily mean that you and I have figured out how to solve the classic puzzle, but other members of humanity have certainly shown the Cube ...

We have met our match at the genteel pastime of jigsaw puzzles. It seems an algorithm can now whiz through 10,000 pieces in 24 hours. The speedy solver could also help piece together shredded ...