Pages that link to "Item:Q4407449"
From MaRDI portal
The following pages link to Semidefinite programs and combinatorial optimization (Q4407449):
Displaying 49 items.
- Max \(k\)-cut and the smallest eigenvalue (Q286169) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- On Farkas lemma and dimensional rigidity of bar frameworks (Q498344) (← links)
- Polyhedral and semidefinite programming methods in combinatorial optimization (Q611309) (← links)
- Convex hulls of curves of genus one (Q645211) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- An object-oriented approach to semidefinite programming (Q1273272) (← links)
- On the complexity of semidefinite programs (Q1361073) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Complementarity and nondegeneracy in semidefinite programming (Q1373731) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- Gray code enumeration of families of integer partitions (Q1805052) (← links)
- Ideals of graph homomorphisms (Q1950425) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- Optimality conditions and global convergence for nonlinear semidefinite programming (Q2297647) (← links)
- On the linear classification of even and odd permutation matrices and the complexity of computing the permanent (Q2359079) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- Maximum algebraic connectivity augmentation is NP-hard (Q2517792) (← links)
- Semidefinite programming based approaches to the break minimization problem (Q2583777) (← links)
- Approximating projections by quantum operations (Q2685389) (← links)
- Integer sequences and semidefinite programming (Q2707265) (← links)
- Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
- Convex Hulls of Algebraic Sets (Q2802521) (← links)
- Two-Level Polytopes with a Prescribed Facet (Q2835684) (← links)
- Semidefinite programming in combinatorial and polynomial optimization (Q2889301) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- (Q3109951) (← links)
- (Q3754444) (← links)
- (Q4496015) (← links)
- Prestress Stability of Triangulated Convex Polytopes and Universal Second-Order Rigidity (Q4599766) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- Undecidability of linear inequalities in graph homomorphism densities (Q5390541) (← links)
- (Q5743405) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- Empirical Properties of Optima in Free Semidefinite Programs (Q6050736) (← links)
- Negativizability: a useful property for distributed state estimation and control in cyber-physical systems (Q6073039) (← links)
- Bounding real tensor optimizations via the numerical range (Q6104069) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)
- Beyond the Existential Theory of the Reals (Q6489317) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)
- Real Schur norms and Hadamard matrices (Q6608147) (← links)