Interesting #popularisation of a new #algorithm to solve the maximum flow and minimum cost problems in #GraphTheory. It brings me back to studying operations research, something I always regret not learning more of. As many problems in the field, interest began in the Soviet Union, in this case to plan and analyse its rail system. https://www.quantamagazine.org/researchers-achieve-absurdly-fast-algorithm-for-network-flow-20220608/
Researchers Achieve ‘Absurdly Fast’ Algorithm for Network Flow | Quanta Magazine

Computer scientists can now solve a decades-old problem in practically the time it takes to write it down.

Quanta Magazine