Pages that link to "Item:Q2784435"
From MaRDI portal
The following pages link to An explicit equivalent positive semidefinite program for nonlinear 0-1 programs (Q2784435):
Displaying 50 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- Sums of squares on the hypercube (Q329957) (← links)
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- The domain of attraction for the endemic equilibrium of an SIRS epidemic model (Q551467) (← links)
- Dynamic modeling and analysis of the email virus propagation (Q714258) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling (Q943789) (← links)
- A polynomial approach for stability analysis of switched systems (Q962173) (← links)
- A semidefinite programming approach to the generalized problem of moments (Q995783) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
- Optimal control of switching topology networks (Q1718012) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Sparsity in sums of squares of polynomials (Q1777218) (← links)
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms (Q1877018) (← links)
- A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)
- \(k\)-point semidefinite programming bounds for equiangular lines (Q2149560) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- The theta number of simplicial complexes (Q2317686) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- The density of sets avoiding distance 1 in Euclidean space (Q2351016) (← links)
- Better approximation algorithms for influence maximization in online social networks (Q2352355) (← links)
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
- Convex sets with semidefinite representation (Q2391000) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- Efficiency improvement in an \(n\)D systems approach to polynomial optimization (Q2457407) (← links)
- Uniform stabilization of discrete-time switched and Markovian jump linear systems (Q2491903) (← links)
- Robust global optimization with polynomials (Q2492692) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- Convex Hulls of Algebraic Sets (Q2802521) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Approximating \(k\)-median via pseudo-approximation (Q2805513) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- SDP gaps from pairwise independence (Q2913812) (← links)
- A polynomial approach for optimal control of switched nonlinear systems (Q2925113) (← links)
- Optimal Learning in Linear Regression with Combinatorial Feature Selection (Q2960366) (← links)
