A hierarchy of relaxation between the continuous and convex hull representations

Projection with a Minimal System of Inequalities

Computational Optimization and Applications

Relaxations of the Satisfiability Problem Using Semidefinite Programming

Journal of Automated Reasoning

Analysis of Bounds for Multilinear Functions

Journal of Global Optimization

A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse

Journal of Global Optimization

Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems

Journal of Global Optimization

Generating Convex Polynomial Inequalities for Mixed 0–1 Programs

Journal of Global Optimization

Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems

Journal of Global Optimization

An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization

Lift-and-project for mixed 0-1 programming: recent progress

Discrete Applied Mathematics

Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics

GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi

ACM Transactions on Mathematical Software (TOMS)

Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem

Journal of Global Optimization

A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem

Journal of Global Optimization

A linear programming reformulation of the standard quadratic optimization problem

Journal of Global Optimization

Computation of the Lasserre Ranks of Some Polytopes

Mathematics of Operations Research

Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs

Mathematics of Operations Research

Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs

Annals of Mathematics and Artificial Intelligence

Linear programming relaxations of maxcut

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra

Discrete Applied Mathematics

A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs

International Journal of Computational Science and Engineering

A branch-and-cut algorithm for two-stage stochastic mixed-binary programs with continuous first-stage variables

International Journal of Computational Science and Engineering

A network approach for specially structured linear programs arising in 0-1 quadratic optimization

Discrete Applied Mathematics

Rank Lower Bounds for the Sherali-Adams Operator

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Cuts for Conic Mixed-Integer Programming

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization

Resolution Width and Cutting Plane Rank Are Incomparable

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science

Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

A geometric characterization of "optimality-equivalent" relaxations

Journal of Global Optimization

Graphical Models, Exponential Families, and Variational Inference

Foundations and Trends® in Machine Learning

Expander flows, geometric embeddings and graph partitioning

Journal of the ACM (JACM)

Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem

Discrete Applied Mathematics

A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions

Discrete Applied Mathematics

Tight rank lower bounds for the Sherali–Adams proof system

Theoretical Computer Science

Message passing algorithms and improved LP decoding

Proceedings of the forty-first annual ACM symposium on Theory of computing

Integrality gaps for Sherali-Adams relaxations

Proceedings of the forty-first annual ACM symposium on Theory of computing

Sherali-adams relaxations of the matching polytope

Proceedings of the forty-first annual ACM symposium on Theory of computing

Note: On the Chvátal rank of the Pigeonhole Principle

Theoretical Computer Science

A p-cone sequential relaxation procedure for 0-1 integer programs

Optimization Methods & Software - GLOBAL OPTIMIZATION

Cutting Planes and the Parameter Cutwidth

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice

Optimal Sherali-Adams Gaps from Pairwise Independence

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems

Operations Research

Hardness amplification in proof complexity

Proceedings of the forty-second ACM symposium on Theory of computing

Public-key cryptography from different assumptions

Proceedings of the forty-second ACM symposium on Theory of computing

Matroid matching: the power of local search

Proceedings of the forty-second ACM symposium on Theory of computing

DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs

Discrete Applied Mathematics

Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths

Management Science

Letter to the editor: An efficient linearization technique for mixed 0-1 polynomial problem

Journal of Computational and Applied Mathematics

Breaking the rectangle bound barrier against formula size lower bounds

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science

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

Improving integrality gaps via Chvátal-Gomory rounding

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Towards Sharp Inapproximability for Any 2-CSP

SIAM Journal on Computing

Local Global Tradeoffs in Metric Embeddings

SIAM Journal on Computing

Knapsack problem with probability constraints

Journal of Global Optimization

Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs

Operations Research

Minimum congestion mapping in a cloud

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Complexity analyses of Bienstock-Zuckerberg and lasserre relaxations on the matching and stable set polytopes

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

An iterative scheme for valid polynomial inequality generation in binary polynomial programming

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

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

Convexification techniques for linear complementarity constraints

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

New tools for graph coloring

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

A bilevel fixed charge location model for facilities under imminent attack

Computers and Operations Research

Sherali-Adams relaxations and indistinguishability in counting logics

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference

Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Towards optimal integrality gaps for hypergraph vertex cover in the lovász-schrijver hierarchy

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

Subsampling mathematical relaxations and average-case complexity

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

On LP-based approximability for strict CSPs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Extending SDP integrality gaps to sherali-adams with applications to quadratic programming and maxcutgain

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

On the rank of cutting-plane proof systems

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Hypercontractivity, sum-of-squares proofs, and their applications

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Branch and cut methods for network optimization

Mathematical and Computer Modelling: An International Journal

A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem

INFORMS Journal on Computing

Block-diagonal semidefinite programming hierarchies for 0/1 programming

Operations Research Letters

The equivalence of semidefinite relaxations of polynomial 0-1 and ±1 programs via scaling

Operations Research Letters

Approximate formulations for 0-1 knapsack sets

Operations Research Letters

Note: On the polyhedral lift-and-project methods and the fractional stable set polytope

Discrete Optimization

Intermediate integer programming representations using value disjunctions

Discrete Optimization

Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement

Discrete Optimization

A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

Discrete Optimization

Tree-width and the Sherali-Adams operator

Discrete Optimization

Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Discrete Optimization

Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs

Discrete Optimization

A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope

Operations Research Letters

Foundation-penalty cuts for mixed-integer programs

Operations Research Letters

Elementary closures for integer programs

Operations Research Letters

Lift-and-project ranks and antiblocker duality

Operations Research Letters

On linear programs with linear complementarity constraints

Journal of Global Optimization

An SDP approach to multi-level crossing minimization

Journal of Experimental Algorithmics (JEA)

Using symmetry to optimize over the sherali-adams relaxation

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Branch and cut algorithms for detecting critical nodes in undirected graphs

Computational Optimization and Applications

Tight compact models and comparative analysis for the prize collecting Steiner tree problem

Discrete Applied Mathematics

0/1 polytopes with quadratic chvátal rank

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Lifts of Convex Sets and Cone Factorizations

Mathematics of Operations Research

Approximating k-median via pseudo-approximation

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Cones of multipowers and combinatorial optimization problems

Computational Mathematics and Mathematical Physics

Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications

Journal of Global Optimization

On integrality ratios for asymmetric TSP in the sherali-adams hierarchy

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Lift-and-Project methods for set cover and knapsack

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems

Proceedings of the 5th conference on Innovations in theoretical computer science

Maximum Matching and Linear Programming in Fixed-Point Logic with Counting

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science