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 10 items.
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- A hybrid exact algorithm for complete set partitioning (Q901033) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← 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)
- (Q3325466) (← links)
- Relaxed complete partitions: an error-correcting Bachet's problem (Q5384252) (← links)
- Searching for optimal integer solutions to set partitioning problems using column generation (Q5416769) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)