Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is fixed. It is demonstrated that in some cases fixing the structure makes the problem easier, whereas in general the problem remains NP-complete.

翻译：组合优化可描述为寻找可行子集以最大化目标函数的问题。本文讨论组合优化问题，其中每个维度的可行子集集合是固定的。研究表明，在某些情况下固定结构会使问题简化，但一般而言该问题仍保持NP完全性。