This website requires JavaScript.

New Classes of Facets for Complementarity Knapsack Problems

Alberto Del PiaJeff LinderothHaoran Zhu
摘要
The complementarity knapsack problem (CKP) is a knapsack problem withreal-valued variables and complementarity conditions between pairs of itsvariables. We extend the polyhedral studies of De Farias et al. for CKP, byproposing three new families of cutting-planes that are all obtained from acombinatorial concept known as a pack. Sufficient conditions for theseinequalities to be facet-defining, based on the concept of a maximal switchingpack, are also provided. Moreover, we answer positively a conjecture by DeFarias et al. about the separation complexity of the inequalities introduced intheir work.
展开全部
图表提取

暂无人提供速读十问回答

论文十问由沈向洋博士提出,鼓励大家带着这十个问题去阅读论文,用有用的信息构建认知模型。写出自己的十问回答,还有机会在当前页面展示哦。

Q1论文试图解决什么问题?
Q2这是否是一个新的问题?
Q3这篇文章要验证一个什么科学假设?
0
被引用
笔记
问答