Reformulation based MaxSat robustness

DOI10.1007/s10601-012-9130-2zbMath1309.90069OpenAlexW2018580185MaRDI QIDQ487654

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

zbMATH Keywords

robustnesscombinatorial optimizationauctionsresource allocationreformulationMaxSatpseudo-Boolean

Mathematics Subject Classification ID

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

Uses Software

• CPLEX
• Gurobi
• Potassco
• Sat4j
• CryptoMiniSat

Cites Work

• 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
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Algorithms for Weighted Boolean Optimization
• The Price of Robustness
• Recent Advances in Constraints
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reformulation based MaxSat robustness