The following pages link to CCEHC (Q51752):
Displaying 7 items.
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- Cooperative parallel SAT local search with path relinking (Q2057122) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
- Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT (Q5015607) (← links)