Satisfiability-based algorithms for Boolean optimization

DOI10.1023/B:AMAI.0000012872.46214.11zbMath1068.90081OpenAlexW2106284444MaRDI QIDQ1430296

Vasco M. Manquinho, João P. Marques-Silva

Publication date: 27 May 2004

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:amai.0000012872.46214.11

zbMATH Keywords

branch-and-boundbacktrack searchpropositional satisfiabilitybinate covering problemnon-chronological backtracking

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (5)

Propositional SAT Solving ⋮ Boolean lexicographic optimization: algorithms \& applications ⋮ A framework for certified Boolean branch-and-bound optimization ⋮ Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One ⋮ Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates

This page was built for publication: Satisfiability-based algorithms for Boolean optimization