Pages that link to "Item:Q2462542"
From MaRDI portal
The following pages link to A relax-and-cut algorithm for the set partitioning problem (Q2462542):
Displaying 4 items.
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM (Q2874033) (← links)
- Exact algorithms for the vertex separator problem in graphs (Q3008917) (← links)
- Searching for optimal integer solutions to set partitioning problems using column generation (Q5416769) (← links)
