A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees
暂无分享,去创建一个
[1] Claire Mathieu,et al. Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack , 2011, IPCO.
[2] Chandra Chekuri,et al. Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs , 2009, APPROX-RANDOM.
[3] Hanif D. Sherali,et al. A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..
[4] Friedrich Eisenbrand,et al. NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..
[5] Jean B. Lasserre,et al. An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.
[6] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[7] Pablo A. Parrilo,et al. Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..
[8] Andreas Wiese,et al. Submodular unsplittable flow on trees , 2016, IPCO.
[9] Laurence A. Wolsey,et al. On the Practical Strength of Two-Row Tableau Cuts , 2014, INFORMS J. Comput..
[10] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[11] Robert Weismantel,et al. Polyhedral properties for the intersection of two knapsacks , 2008, Math. Program..
[12] Paul S. Bonsma,et al. A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[13] Amit Kumar,et al. Approximation Algorithms for the Unsplittable Flow Problem , 2002, Algorithmica.
[14] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[15] Álinson S. Xavier. Computing with Multi-Row Intersection Cuts , 2017 .
[16] Zhihan Gao,et al. On Linear Programming Relaxations for Unsplittable Flow in Trees , 2015, APPROX-RANDOM.
[17] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[18] Baruch Schieber,et al. A quasi-PTAS for unsplittable flow on line graphs , 2006, STOC '06.
[19] Fabrizio Grandoni,et al. To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack , 2017, SODA.
[20] Chandra Chekuri,et al. Multicommodity demand flow in a tree and packing integer programs , 2007, TALG.
[21] Sanjeev Khanna,et al. The all-or-nothing multicommodity flow problem , 2004, STOC '04.
[22] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[23] Marco Molinaro,et al. Theoretical challenges towards cutting-plane selection , 2018, Math. Program..