On applying cutting planes in DLL-based algorithms for pseudo-Boolean optimization

DOI10.1007/11499107_38MaRDI QIDQ5713742zbMATH OpenOpenAlexFDO

Authors Vasco Manquinho, Joao Marques-Silva

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137280, https://eprints.soton.ac.uk/261995/1/jpms-sat05a.pdf

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean programming (90C09)

Recommendations

• On using cutting planes in pseudo-Boolean optimization
• Improving Unsatisfiability-Based Algorithms for Boolean Optimization
• Dynamic symmetry-breaking for Boolean satisfiability
• Counting Models in Integer Domains
• scientific article; zbMATH DE number 5139167

Cited in

(2)

• Bilevel biobjective pseudo Boolean programming problems
• On using cutting planes in pseudo-Boolean optimization

Describes a project that uses

Uses Software

• PBS

This page was built for publication: On applying cutting planes in DLL-based algorithms for pseudo-Boolean optimization

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