Pages that link to "Item:Q324843"
From MaRDI portal
The following pages link to A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843):
Displaying 5 items.
- Automatic integer programming reformulation using variable neighborhood search (Q1687624) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)