Pages that link to "Item:Q1751163"
From MaRDI portal
The following pages link to Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163):
Displaying 6 items.
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- Set covering problem with conflict constraints (Q2147026) (← links)
- A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)