Pages that link to "Item:Q5919994"
From MaRDI portal
The following pages link to Extended formulations in combinatorial optimization (Q5919994):
Displaying 16 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)
- Extension complexity of formal languages (Q778518) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Fooling sets and the spanning tree polytope (Q1705643) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
- Solving the Distance-Based Critical Node Problem (Q5087707) (← 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)
