The complexity of facets (and some facets of complexity)

Publisher Website
Google Scholar
Abstract
Many important combinatorial optimization problems, including the traveling salesman problem (TSP), the clique problem and many others, call for the optimization of a linear functional over some discrete set of vectors.