Search techniques for SAT-based Boolean optimization (Q2455454): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: BerkMin: A fast and robust SAT-solver / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3624016 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A machine program for theorem-proving / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast search algorithms for the n-queens problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic symmetry-breaking for Boolean satisfiability / rank | |||
Normal rank | |||
Latest revision as of 11:53, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Search techniques for SAT-based Boolean optimization |
scientific article |
Statements
Search techniques for SAT-based Boolean optimization (English)
0 references
24 October 2007
0 references
Optimization algorithms
0 references
integer linear programming
0 references
backtrack search
0 references
Boolean satisfiability
0 references
