Pages that link to "Item:Q1316095"

The following pages link to Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095):

Displaying 4 items.

• 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)