Pages that link to "Item:Q1752480"
From MaRDI portal
The following pages link to General cut-generating procedures for the stable set polytope (Q1752480):
Displaying 10 items.
- A strengthened general cut-generating procedure for the stable set polytope (Q324806) (← links)
- Local cuts revisited (Q1003489) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- On the combinatorics of the 2-class classification problem (Q2419359) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques (Q2675702) (← links)
- (Q2712302) (← links)
- A new facet generating procedure for the stable set polytope (Q2840706) (← 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)