Pages that link to "Item:Q2248762"
From MaRDI portal
The following pages link to Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762):
Displaying 13 items.
- On \(t\)-branch split cuts for mixed-integer programs (Q378102) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- A local maximizer for lattice width of 3-dimensional hollow bodies (Q2028093) (← links)
- Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
- Lattice-free simplices with lattice width \(2d - o(d)\) (Q2164720) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
- On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width (Q4976155) (← links)
- Hollow polytopes of large width (Q5210954) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
