The complexity of facets (and some facets of complexity)

1 January 1982

proceedings article
Published by Association for Computing Machinery (ACM)

Vol. 28 (2) , 255-260
https://doi.org/10.1145/800070.802199

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.

Keywords

FACETS
OPTIMIZATION PROBLEMS
CLIQUE PROBLEM
IMPORTANT COMBINATORIAL
SALESMAN PROBLEM
LINEAR FUNCTIONAL
DISCRETE SET
COMBINATORIAL OPTIMIZATION

This publication has 0 references indexed in Scilit: