Branch-and-bound is the workhorse of all state-of-the-art mixed integer linear programming (MILP) solvers. These implementations of branch-and-bound typically use variable branching, that is, the ...

One day in November, a product strategist we’ll call Michelle (not her real name), logged into her LinkedIn account and switched her gender to male. She also changed her name to Michael, she told ...

Social media companies and their respective algorithms have repeatedly been accused of fueling political polarization by promoting divisive content on their platforms. Now, two U.S. Senators have ...

This repository contains code relating to the paper "A Combinatorial Branch-and-Bound Algorithm for the Capacitated Facility Location Problem under Strict Customer Preferences" by Christina Büsing, ...

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

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

These days, everyone seems to have an opinion about A.I. companions. Last year, I found myself joining the debate, publishing a paper—co-written with two fellow psychology professors and a philosopher ...

Abstract: In this paper, an urban aerial delivery problem (UADP) is investigated, where the parcel transportation service is accomplished by drones in an urban setting. The aim of the problem is to ...

When employees at Meta started developing their flagship AI model, Llama 3, they faced a simple ethical question. The program would need to be trained on a huge amount of high-quality writing to be ...

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...