Pages that link to "Item:Q1316095"
From MaRDI portal
The following pages link to Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095):
Displaying 6 items.
- Parallel and serial heuristics for the minimum set cover problem (Q1186830) (← links)
- Multivariate composite distributions for coefficients in synthetic optimization problems (Q1969891) (← links)
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers (Q2963918) (← links)