On inequalities with bounded coefficients and pitch for the min knapsack polytope

Daniel Bienstock,Yuri Faenza,Igor Malinović,Monaldo Mastrolilli,Ola Svensson,Mark Zuckerberg

Discrete Optimization（2022）

引用 5|浏览98

暂无评分

摘要

The min knapsack problem appears as a major component in the structure of capacitated covering problems. Its polyhedral relaxations have been extensively studied, leading to strong relaxations for networking, scheduling and facility location problems.

查看译文

关键词

Minimum Knapsack,Bounded Pitch,Bounded Coefficients,Separation algorithm,Integrality Gap

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要