The following pages link to (Q4537750):
Displaying 27 items.
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- Fair Colorful k-Center Clustering (Q5041747) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- (Q5091238) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations (Q5216778) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
- (Q5743406) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5918420) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
- Evaluating approximations of the semidefinite cone with trace normalized distance (Q6043109) (← links)
- Bootstrap, Markov chain Monte Carlo, and LP/SDP hierarchy for the lattice Ising model (Q6142617) (← links)
- A knapsack intersection hierarchy (Q6161286) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
- Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations (Q6574949) (← links)
- On different versions of the exact subgraph hierarchy for the stable set problem (Q6585245) (← links)
- Partial reformulation-linearization based optimization models for the Golomb ruler problem (Q6658434) (← links)
