The following pages link to (Q4537750):
Displaying 50 items.
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- Strengthened semidefinite programming bounds for codes (Q868466) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- Geometric proofs for convex hull defining formulations (Q1755829) (← links)
- A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
- Lift-and-project ranks and antiblocker duality (Q1886795) (← links)
- Ensemble clustering using semidefinite programming with applications (Q1959572) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- Fair colorful \(k\)-center clustering (Q2118132) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Sparse learning via Boolean relaxations (Q2349117) (← links)
- Tree-width and the Sherali-Adams operator (Q2386210) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Polyhedra related to integer-convex polynomial systems (Q2583123) (← links)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
- Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes (Q3009747) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
