Pages that link to "Item:Q2027062"
From MaRDI portal
The following pages link to Preprocessing and cutting planes with conflict graphs (Q2027062):
Displaying 7 items.
- A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- On recognizing staircase compatibility (Q2093277) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Preprocessing and Cutting Planes with Conflict Graphs (Q6325473) (← links)