Pages that link to "Item:Q1634772"
From MaRDI portal
The following pages link to The matching relaxation for a class of generalized set partitioning problems (Q1634772):
Displaying 5 items.
- Solution of the generalized Neyman-Pearson problem using the methods for the optimal partitioning of sets (Q1189793) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem (Q2466594) (← links)