#399: Travelling Salesman Problem
|< First
< Prev
Random
Next >
Last >|
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 ...
Original on XKCD
ExplainXKCD
Back to Index