Pages that link to "Item:Q2496053"
From MaRDI portal
The following pages link to Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053):
Displayed 9 items.
- Exact solutions to generalized vertex covering problems: a comparison of two models (Q499689) (← links)
- On a posterior evaluation of a simple greedy method for set packing (Q941055) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs (Q1750334) (← links)
- A fast attribute reduction method for large formal decision contexts (Q1999570) (← links)
- A graph approach for fuzzy-rough feature selection (Q2219196) (← links)
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems (Q2228416) (← links)
- A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)