Pages that link to "Item:Q896280"
From MaRDI portal
The following pages link to Lifting properties of maximal lattice-free polyhedra (Q896280):
Displaying 16 items.
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- The covering radius and a discrete surface area for non-hollow simplices (Q2066303) (← links)
- Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
- The (not so) trivial lifting in two dimensions (Q2281447) (← links)
- The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
- Maximal \(S\)-free convex sets and the Helly number (Q2835843) (← links)
- Unique minimal liftings for simplicial polytopes (Q2884321) (← links)
- Operations that Preserve the Covering Property of the Lifting Region (Q3454508) (← links)
- Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three (Q4595955) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)
- Hollow polytopes of large width (Q5210954) (← links)
- Nonunique Lifting of Integer Variables in Minimal Inequalities (Q5376544) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
