Pages that link to "Item:Q1374381"
From MaRDI portal
The following pages link to A combinatorial column generation algorithm for the maximum stable set problem (Q1374381):
Displaying 8 items.
- Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
- The travelling preacher, projection, and a lower bound for the stability number of a graph (Q951102) (← links)
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (Q1296804) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- Column-Generation in Integer Linear Programming (Q4450558) (← 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)
- Searching for optimal integer solutions to set partitioning problems using column generation (Q5416769) (← links)