Pages that link to "Item:Q1186549"
From MaRDI portal
The following pages link to Expressing combinatorial optimization problems by linear programs (Q1186549):
Displayed 50 items.
- Extended formulations for convex heptagons (Q265972) (← links)
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- New formulations for the elementary shortest-path problem visiting a given set of nodes (Q323412) (← links)
- Common information and unique disjointness (Q343843) (← links)
- Matrices with high completely positive semidefinite rank (Q344893) (← links)
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts (Q344935) (← links)
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- Copositive matrices with circulant zero support set (Q347484) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- Clique versus independent set (Q402465) (← links)
- Linear algebraic methods in communication complexity (Q417541) (← links)
- On the nonnegative rank of distance matrices (Q436566) (← links)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
- Comment on ``Hypothesis testing by convex optimization'' (Q491382) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Realizability of polytopes as a low rank matrix completion problem (Q741602) (← links)
- Smallest compact formulation for the permutahedron (Q745678) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- Tropical lower bounds for extended formulations (Q745680) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Worst-case results for positive semidefinite rank (Q745690) (← links)
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- Some order dimension bounds for communication complexity problems (Q921909) (← links)
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- Compact vs. exponential-size LP relaxations (Q1612003) (← links)
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Learning semidefinite regularizers (Q1740575) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- Easy and optimal queries to reduce set uncertainty (Q1752234) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)