NuMVC
From MaRDI portal
Software:20229
No author found.
Related Items (15)
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 ⋮ 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 ⋮ Towards faster local search for minimum weight vertex cover on massive graphs ⋮ Can local optimality be used for efficient data reduction? ⋮ An efficient heuristic algorithm for solving connected vertex cover problem ⋮ \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems ⋮ Local search for Boolean satisfiability with configuration checking and subscore ⋮ CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ An efficient local search framework for the minimum weighted vertex cover problem ⋮ A New Solver 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
This page was built for software: NuMVC
