Pages that link to "Item:Q1621696"
From MaRDI portal
The following pages link to Intersection cuts for single row corner relaxations (Q1621696):
Displaying 6 items.
- onerow (Q43469) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- How tight is the corner relaxation? (Q951100) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)