Pages that link to "Item:Q745678"
From MaRDI portal
The following pages link to Smallest compact formulation for the permutahedron (Q745678):
Displayed 38 items.
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Extended formulations for sparsity matroids (Q304267) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- A short convex-hull proof for the all-different system with the inclusion property (Q1785324) (← links)
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
- Permutatorial optimization via the permutahedron (Q2083997) (← links)
- Computational complexity of computing a quasi-proper equilibrium (Q2140505) (← links)
- Nonnegative rank factorization -- a heuristic approach via rank reduction (Q2248962) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- Minimum linear arrangements (Q2413151) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
- A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
- Constructing Extended Formulations from Reflection Relations (Q3009770) (← links)
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies (Q3451762) (← links)
- Convex Relaxations for Permutation Problems (Q3456867) (← links)
- A Lower Bound on the Positive Semidefinite Rank of Convex Bodies (Q4564016) (← links)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
- (Q5089218) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results (Q5247623) (← links)
- Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis (Q5870347) (← links)
- Generalized permutahedra: Minkowski linear functionals and Ehrhart positivity (Q6048806) (← links)
- Lifts for Voronoi cells of lattices (Q6050227) (← links)