Pages that link to "Item:Q4640350"

The following pages link to The Matching Polytope has Exponential Extension Complexity (Q4640350):

Displaying 47 items.

• On the extension complexity of scheduling polytopes (Q2661503) (← links)
• Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
• Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
• A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
• Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
• Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
• Query Complexity in Expectation (Q3448835) (← links)
• Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
• Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
• On Ranks of Regular Polygons (Q4594484) (← links)
• Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
• Symmetry Matters for Sizes of Extended Formulations (Q4899066) (← links)
• Extended formulations of lower-truncated transversal polymatroids (Q4999331) (← links)
• On Polyhedral Approximations of the Positive Semidefinite Cone (Q5026447) (← links)
• Sparktope: linear programs from algorithms (Q5043848) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
• Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
• Extension complexity of low-dimensional polytopes (Q5082401) (← links)
• From Duels to Battlefields: Computing Equilibria of Blotto and Other Games (Q5108243) (← links)
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem (Q5137957) (← links)
• (Q5140843) (← links)
• Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
• The Slack Realization Space of a Polytope (Q5194621) (← links)
• A Parametrized Analysis of Algorithms on Hierarchical Graphs (Q5205039) (← links)
• The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) (← links)
• No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
• (Q5259560) (redirect page) (← links)
• Positive semidefinite rank and nested spectrahedra (Q5375914) (← links)
• An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← links)
• Parameterized shifted combinatorial optimization (Q5915595) (← links)
• Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
• Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
• Lifts for Voronoi cells of lattices (Q6050227) (← links)
• Shadows of Newton polytopes (Q6076195) (← links)
• ReLU neural networks of polynomial size for exact maximum flow computation (Q6086001) (← links)
• Complex psd-minimal polytopes in dimensions two and three (Q6089230) (← links)
• The Frank-Wolfe algorithm: a short introduction (Q6118086) (← links)
• Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
• The role of rationality in integer-programming relaxations (Q6126664) (← links)
• Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems (Q6173957) (← links)
• Circuits in extended formulations (Q6564188) (← links)
• Scalable Frank-Wolfe on generalized self-concordant functions via simple steps (Q6573011) (← links)
• A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs (Q6608035) (← links)