<p><img src="https://imgs.xkcd.com/comics/travelling_salesman_problem.png" alt="What&#x27;s the complexity class of the best linear programming cutting-plane techniques?  I couldn&#x27;t find it anywhere.  Man, the Garfield guy doesn&#x27;t have these problems ..."></p>
<blockquote>
<p>"<a href="https://xkcd.com/399/">Travelling Salesman Problem</a>", by Randall Munroe, licensed under Creative Commons Attribution-NonCommercial 2.5 License</p>
</blockquote>
<h2 id="alt-text"><a aria-hidden="true" class="anchor-heading" href="#alt-text"><svg aria-hidden="true" viewBox="0 0 16 16"><use xlink:href="#svg-link"></use></svg></a>Alt Text</h2>
<p>What's the complexity class of the best linear programming cutting-plane techniques?  I couldn't find it anywhere.  Man, the Garfield guy doesn't have these problems ...</p>

xkcd

Travelling Salesman Problem


# XKCD

This is a published Dendron [vault](https://wiki.dendron.so/notes/c6fd6bc4-7f75-4cbb-8f34-f7b99bfe2d50.html#vaults) for [xkcd](https://xkcd.com/). It is generated and published using [Dendron](http://dendron.so/), the open source note-taking tool that grows as you do 🌱

All content on this site is from xkcd and licensed under the [Creative Commons Attribution-NonCommercial 2.5 License](https://creativecommons.org/licenses/by-nc/2.5/).

If you would like to have local access to this vault, you can do so by adding it from Dendron from [this repository](https://github.com/kevinslin/seed-xkcd).
