Pages that link to "Item:Q2949518"
From MaRDI portal
The following pages link to Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518):
Displaying 5 items.
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- Projective Cutting-Planes (Q5221062) (← links)
