Tag Archives: Michael Todd

News (mainly polymath related)

Posted on January 20, 2016 by Gil Kalai

Update (Jan 21) j) Polymath11 (?) Tim Gowers’s proposed a polymath project on Frankl’s conjecture. If it will get off the ground we will have (with polymath10) two projects running in parallel which is very nice. (In the comments Jon Awbrey gave … Continue reading →

Posted in Combinatorics, Conferences, Mathematics over the Internet, Polymath10, Polymath3, Updates | Tagged David Speyer, Dinesh Thakur, Michael Todd, Noga Alon, Peter Frankl, Shafi Goldwasser, Terrence Tao, Thomas Royen | 11 Comments

IPAM remote blogging: The Many Facets of Linear Programming

Posted on January 20, 2011 by Gil Kalai

The many facets of Linear Programming Here is an extremely nice paper by Michael Todd from 2001. It gives useful background for many lectures and it can serve as a good base point to examine last decade’s progress. Background post for … Continue reading →

Posted in Computer Science and Optimization | Tagged Linear programming, Michael Todd | Leave a comment

	fedja on Chess can be a Game of Lu…
	qm computing summer… on The Race to Quantum Technologi…
	Murat Aygen on Remote Blogging: Efficiency of…
	Gil Kalai on Chess can be a Game of Lu…
	fedja on Chess can be a Game of Lu…
	Solvig Kadison-Singe… on The Kadison-Singer Conjecture…
	Matthew Cory on Call for nominations for the O…
	Matthew Cory on The Race to Quantum Technologi…
	domotorp on Chess can be a Game of Lu…
	Gil Kalai on The Race to Quantum Technologi…
	Notes of the seminar… on Mind Boggling: Following the w…
	Optimal Colorful Tve… on Seven Problems Around Tverberg…

Tag Archives: Michael Todd

News (mainly polymath related)

IPAM remote blogging: The Many Facets of Linear Programming

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives