Reformulation based MaxSat robustness
From MaRDI portal
Publication:487654
Recommendations
- Modeling robustness in CSPs as weighted CSPs
- Robust satisfiability for CSPs: hardness and algorithmic results
- Solving Max-SAT as weighted CSP
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Robustness and stability in constraint programming under dynamism and uncertainty
Cites work
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5547835 (Why is no real title available?)
- 2006 and 2007 Max-SAT evaluations: contributed instances
- Algorithms for Weighted Boolean Optimization
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Handbook of constraint programming.
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Model building in mathematical programming.
- Modelling Max-CSP as Partial Max-SAT
- Recent Advances in Constraints
- Reducing chaos in SAT-like search: finding solutions close to a given one
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- The Price of Robustness
- The first and second Max-SAT evaluations
This page was built for publication: Reformulation based MaxSat robustness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487654)