Pages that link to "Item:Q2282264"
From MaRDI portal
The following pages link to An efficient local search framework for the minimum weighted vertex cover problem (Q2282264):
Displaying 15 items.
- Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- A simple LP-free approximation algorithm for the minimum weight vertex cover problem (Q673599) (← links)
- An ant colony optimization algorithm for the minimum weight vertex cover problem (Q702732) (← links)
- New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- Weighted vertices optimizer (WVO): a novel metaheuristic optimization algorithm (Q1735708) (← links)
- Towards faster local search for minimum weight vertex cover on massive graphs (Q2200662) (← links)
- Large scale continuous global optimization based on micro differential evolution with local directional search (Q2201688) (← links)
- Local search for diversified top-\(k\) clique search problem (Q2289947) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
- (Q5420473) (← links)
- On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms (Q5738854) (← links)
- MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
