WPM3

swMATH41870MaRDI QIDQ5973734FDOQ5973734

Author name not available (Why is that?)

Described by source

• WPM3: an (in)complete algorithm for weighted partial MaxSAT

Cited In (5)

• An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• Polarity and variable selection heuristics for SAT-based anytime MaxSAT
• SAT-based models for overlapping community detection in networks
• \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT

This page was built for software: WPM3