Reformulation based MaxSat robustness

DOI10.1007/S10601-012-9130-2zbMATH Open1309.90069OpenAlexW2018580185MaRDI QIDQ487654FDOQ487654

Miquel Bofill, Mateu Villaret, Dídac Busquets, Víctor Muñoz

Publication date: 22 January 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-012-9130-2

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

zbMATH Keywords

combinatorial optimizationrobustnessresource allocationauctionsreformulationMaxSatpseudo-Boolean

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stochastic programming (90C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Price of Robustness
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Algorithms for Weighted Boolean Optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• The first and second Max-SAT evaluations
• Title not available (Why is that?)
• 2006 and 2007 Max-SAT evaluations: contributed instances
• Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
• Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One
• Modelling Max-CSP as Partial Max-SAT
• Title not available (Why is that?)
• Recent Advances in Constraints
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Uses Software

• CPLEX
• Gurobi
• Potassco
• Sat4j
• CryptoMiniSat

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)