NuMVC
From MaRDI portal
Cited in
(27)- QUALEX
- An efficient heuristic algorithm for solving connected vertex cover problem
- BHOSLIB
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- dynASP
- Towards faster local search for minimum weight vertex cover on massive graphs
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
- An improved configuration checking-based algorithm for the unicost set covering problem
- An efficient local search framework for the minimum weighted vertex cover problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Backdoors to tractable answer set programming
- CCASat
- Sparrow2011
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
- Can local optimality be used for efficient data reduction?
- A new solver for the minimum weighted vertex cover problem
- CircuitTSAT
- SCCWalk
- tw-heuristic
- Local search for Boolean satisfiability with configuration checking and subscore
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- CCLS
- CCEHC
- gpuls-mwcp
- ils-mwis
This page was built for software: NuMVC
