On bounded pitch inequalities for the min-knapsack polytope
暂无分享,去创建一个
[1] Diego Klabjan,et al. The complexity of cover inequality separation , 1998, Oper. Res. Lett..
[2] Daniel Bienstock,et al. Approximate fixed-rank closures of covering problems , 2006, Math. Program..
[3] Samuel Fiorini,et al. Strengthening convex relaxations of 0/1-sets using Boolean formulas , 2017, Mathematical Programming.
[4] Robert D. Carr,et al. Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.
[5] Adam Kurpisz,et al. On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy , 2015, ICALP.
[6] Ola Svensson,et al. Small extended formulation for knapsack cover inequalities from monotone circuits , 2017, SODA 2017.
[7] D.,et al. THE COMPLEXITY OF COVER INEQUALITY SEPARATION , 1998 .
[8] Adam Kurpisz,et al. On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy , 2015, Math. Oper. Res..
[9] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[10] Gérard Cornuéjols,et al. Integer programming , 2014, Math. Program..
[11] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[12] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[13] Carlos Eduardo Fereirra. On Combinatorial Optimization Problems Arising in Computer System Design , 1994 .
[14] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[15] Daniel Bienstock,et al. Approximate formulations for 0-1 knapsack sets , 2008, Oper. Res. Lett..