Pages that link to "Item:Q5919994"

The following pages link to Extended formulations in combinatorial optimization (Q5919994):

Displaying 49 items.

• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• Improved compact formulations for metric and cut polyhedra (Q325413) (← links)
• Cutting planes from extended LP formulations (Q507316) (← links)
• Realizability of polytopes as a low rank matrix completion problem (Q741602) (← links)
• Smallest compact formulation for the permutahedron (Q745678) (← links)
• Uncapacitated flow-based extended formulations (Q745688) (← links)
• Extension complexity of formal languages (Q778518) (← links)
• Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
• Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
• Compact extended linear programming models (Q1693865) (← links)
• Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
• Fooling sets and the spanning tree polytope (Q1705643) (← links)
• Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
• Combinatorial bounds on nonnegative rank and extended formulations (Q1759811) (← links)
• Extended formulations for vertex cover (Q1790198) (← links)
• A smaller extended formulation for the odd cycle inequalities of the stable set polytope (Q1983107) (← links)
• Recognizing Cartesian products of matrices and polytopes (Q2056923) (← links)
• Packing, partitioning, and covering symresacks (Q2192122) (← links)
• Extension complexity of the correlation polytope (Q2294265) (← links)
• Extended formulations for radial cones (Q2294359) (← links)
• Extension complexities of Cartesian products involving a pyramid (Q2404613) (← links)
• Polytopes associated with symmetry handling (Q2414904) (← links)
• Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
• 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)
• Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
• Extended Formulation Lower Bounds via Hypergraph Coloring (Q2955024) (← links)
• Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
• Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
• (Q3386630) (← links)
• Symmetry Matters for Sizes of Extended Formulations (Q4899066) (← links)
• Extended formulations of lower-truncated transversal polymatroids (Q4999331) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• Extension complexity of low-dimensional polytopes (Q5082401) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Semidefinite Descriptions of the Convex Hull of Rotation Matrices (Q5501229) (← links)
• Advances in Combinatorial Optimization (Q5744058) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
• Extended formulations in combinatorial optimization (Q5900907) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
• Lifts for Voronoi cells of lattices (Q6050227) (← links)
• A strong formulation for the graph partition problem (Q6068542) (← links)
• The Polyhedral Geometry of Pivot Rules and Monotone Paths (Q6075416) (← links)
• Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)
• The role of rationality in integer-programming relaxations (Q6126664) (← links)
• Slack matrices, \(k\)-products, and 2-level polytopes (Q6558684) (← links)
• Circuits in extended formulations (Q6564188) (← links)