CCEHC
From MaRDI portal
Software:51752
No author found.
Related Items (7)
An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem ⋮ An efficient local search algorithm for solving maximum edge weight clique problem in large graphs ⋮ Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability ⋮ An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses ⋮ Cooperative parallel SAT local search with path relinking ⋮ Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT ⋮ A refined branching algorithm for the maximum satisfiability problem
This page was built for software: CCEHC
