Pages that link to "Item:Q502391"

The following pages link to CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391):

Displaying 10 items.

• CCEHC (Q51752) (← links)
• 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)
• CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
• Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT (Q5015607) (← links)