Tag Archives: TSP

Projections to the TSP Polytope

Posted on December 7, 2011 by Gil Kalai

Michael Ben Or told me about the following great paper Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds by Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary and Ronald de Wolf. The paper solves an old conjecture … Continue reading →

Posted in Computer Science and Optimization, Convex polytopes | Tagged Convex polytopes, Linear programming, Quantum computation, TSP | 1 Comment

	Weekly links for May… on Taking balls away: Oz’…
	Dan Mostow on Haaret… on A Few Slides and a Few Comment…
	Michael Bacon on My Quantum Debate with Aram…
	navid on Oz’ Balls Problem: The…
	Josué Ortega on Test Your Intuition (21):…
	Test Your Intuition… on Test Your Intuition (17): What…
	Douglas Zare on Taking balls away: Oz’…
	noah on Taking balls away: Oz’…
	ameyerowitz on Taking balls away: Oz’…
	ameyerowitz on Taking balls away: Oz’…
	Aaron on Taking balls away: Oz’…
	Gil Kalai on Answer: Lord Kelvin, The Age o…

Tag Archives: TSP

Projections to the TSP Polytope

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives

Tags

Follow “Combinatorics and more”