A computer program has been created that will open a challenging field in synthetic biology to the entire world -- repetitive polypeptides. The freely available computer program based on the ...

Not long ago, a team of researchers from Stanford and McGill universities broke a 35-year record in computer science by an almost imperceptible margin — four hundredths of a trillionth of a trillionth ...

Bumblebees can find the solution to a complex mathematical problem which keeps computers busy for days. Scientists in the UK have discovered that bees learn to fly the shortest possible route between ...

The goal of a combinatorial optimization problem is to find a set of distinct integer values that minimizes some cost function. The most famous example is the Traveling Salesman Problem (TSP). There ...

The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the ...

The travelling salesman problem is of fundamental interest to mathematicians and physicists, and has a number of practical applications, such as computer design. At first sight, the related travelling ...