Pages that link to "Item:Q646517"
From MaRDI portal
The following pages link to Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517):
Displaying 28 items.
- New local search methods for partial MaxSAT (Q329035) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- Towards faster local search for minimum weight vertex cover on massive graphs (Q2200662) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
- Local search for diversified top-\(k\) clique search problem (Q2289947) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (Q3453204) (← links)
- Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains (Q4992313) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- The solution space structure of planted constraint satisfaction problems with growing domains (Q5066057) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
- New stochastic local search approaches for computing preferred extensions of abstract argumentation (Q5145445) (← links)
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
- MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
