Pages that link to "Item:Q614041"
From MaRDI portal
The following pages link to Lifting, tilting and fractional programming revisited (Q614041):
Displaying 7 items.
- The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions (Q1748494) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)
- Tilted inequalities and facets of the set covering polytope: a theoretical analysis (Q6611016) (← links)
