This repository contains a list of papers, theses, datasets, blogs, github repos and tools for the bin packing problem (online bpp, temporal bpp, knapsack problem ...

A new quantum-inspired algorithm has cracked a problem so massive that conventional supercomputers struggle to even approach it. Researchers used the method to simulate extraordinarily complex quantum ...

LinkedIn's algorithm has changed, making old tactics obsolete. Align your profile with content topics. Prioritize "saves" as the key engagement metric by creating valuable, referenceable content. Post ...

Among high school students and adults, girls and women are much more likely to use traditional, step-by-step algorithms to solve basic math problems – such as lining up numbers to add, starting with ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Children as young as 4 years old are capable of finding efficient solutions to complex problems, such as independently inventing sorting algorithms developed by computer scientists. The scientists ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

After just a few months of work, a complete newcomer to the world of sphere packing has solved one of its biggest open problems. In math, the search for optimal patterns never ends. The sphere-packing ...

Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...

AlphaEvolve uses large language models to find new algorithms that outperform the best human-made solutions for data center management, chip design, and more. Google DeepMind has once again used large ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...