Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Papadimitriou et al. (1982) studied this question.