A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Mathematics of Operations Research
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Matrix-Cut Rank of Polyhedra
Mathematics of Operations Research
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming
Mathematics of Operations Research
Subset Algebra Lift Operators for 0-1 Integer Programming
SIAM Journal on Optimization
Approximate fixed-rank closures of covering problems
Mathematical Programming: Series A and B
Fast approximation algorithms for knapsack problems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Tree-width and the Sherali-Adams operator
Discrete Optimization
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
| Hi-index | 0.00 |
We show that for each 0