Pages that link to "Item:Q324843"

The following pages link to A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843):

Displaying 3 items.

• Automatic integer programming reformulation using variable neighborhood search (Q1687624) (← links)
• General cut-generating procedures for the stable set polytope (Q1752480) (← links)
• Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)