Hub location problems can be modeled in several ways, one of which is the path-based family of models that make use of four-index variables. Clique inequalities are frequently used to describe solution characteristics for optimization problems with binary variables. In this study, new valid inequalities of the clique type are introduced for the path-based family of hub location models. Some of their properties and corresponding lifting are discussed, and a separation heuristic algorithm is proposed. We also report a set of computational experiments to evaluate the usefulness of the proposals when embedded in a commercial solver.

中文翻译：

---

四指数枢纽位置模型中的一些新的派系不平等


枢纽位置问题可以通过多种方式建模，其中之一是使用四索引变量的基于路径的模型系列。团不等式经常用于描述二元变量优化问题的解特征。在本研究中，为基于路径的枢纽位置模型族引入了新的有效的派系类型不等式。讨论了它们的一些属性和相应的提升，并提出了分离启发式算法。我们还报告了一组计算实验，以评估建议嵌入商业求解器时的有用性。