How can you have a proof without proving anything? Mathematicians found a way and, in the process, came to blows over it – ...

The original version of this story appeared in Quanta Magazine. In 1939, upon arriving late to his statistics course at UC Berkeley, George Dantzig—a first-year graduate student—copied two problems ...

Crunching hard grains together leads to their rigidification, irrespective of how the system is prepared. While certain features of the resulting jammed materials—e.g. their contact force distribution ...

The leading approach to the simplex method, a widely used technique for balancing complex logistical constraints, can’t get any better. In 1939, upon arriving late to his statistics course at the ...

In 1939, George Dantzig was pursuing a doctoral programme in mathematics at the University of California, Berkeley, where he studied statistics under Jerzy Neyman. Of all his achievements, a ...

Resource allocation of wide-area internet networks is inherently a combinatorial optimization problem that if solved quickly, could provide near real-time adaptive control of internet-protocol traffic ...