The following pages link to NuMVC (Q20229):
Displaying 15 items.
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← 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)
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems (Q2228416) (← 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)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs (Q2689443) (← links)
- Can local optimality be used for efficient data reduction? (Q2692734) (← links)
- A New Solver for the Minimum Weighted Vertex Cover Problem (Q2815127) (← links)
