CCEHC

swMATH36050MaRDI QIDQ51752FDOQ51752

Author name not available (Why is that?)

Described by source

• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability

Cited In (7)

• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• A refined branching algorithm for the maximum satisfiability problem
• An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
• An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
• Cooperative parallel SAT local search with path relinking
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
• \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT

This page was built for software: CCEHC