Incomplete dynamic backtracking for linear pseudo-Boolean problems

DOI10.1023/B:ANOR.0000032570.90510.8FMaRDI QIDQ1876529zbMATH OpenFDO

Authors Steven Prestwich

Publication date 20 August 2004

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

local searchsatisfiabilityinteger programs

Mathematics Subject Classification ID

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

Recommendations

• An overview of backtrack search satisfiability algorithms
• Combining the scalability of local search with the pruning techniques of systematic search
• scientific article; zbMATH DE number 5139167
• Progress in Artificial Intelligence
• Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques

Cited in

(4)

• Generalised graph colouring by a hybrid of local search and constraint programming
• Multicriteria models for planning power-networking events
• Exploiting relaxation in local search for LABS
• Template design under demand uncertainty by integer linear local search

Describes a project that uses

Uses Software

• Velev SAT Benchmarks
• Chaff
• SATIRE

This page was built for publication: Incomplete dynamic backtracking for linear pseudo-Boolean problems

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