Pages that link to "Item:Q5704137"
From MaRDI portal
The following pages link to A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming (Q5704137):
Displaying 50 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Duality for mixed-integer convex minimization (Q304264) (← links)
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← 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)
- Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities (Q891237) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling (Q943789) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
