Solving generalized optimization problems subject to SMT constraints

DOI10.1007/978-3-642-29700-7_23MaRDI QIDQ2897999zbMATH OpenOpenAlexFDO

Authors Feifei Ma, Jian Zhang, Jun Yan

Publication date 16 July 2012

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29700-7_23

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• On SAT Modulo Theories and Optimization Problems
• Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
• Optimization modulo theories with linear rational costs
• A system for solving constraint satisfaction problems with SMT
• \textsc{OptiMathSAT}: a tool for optimization modulo theories

Cited in

(2)

• Exploiting partial-assignment enumeration in optimization modulo theories
• Real-time system design based on logic OR constrained optimization

This page was built for publication: Solving generalized optimization problems subject to SMT constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897999)