Consistency for 0-1 programming

DOI10.1007/978-3-030-19212-9_15MaRDI QIDQ2327255zbMATH OpenOpenAlexFDO

Authors Danial Davarnia, John N. Hooker

Publication date 14 October 2019

Full work available at URL https://arxiv.org/abs/1812.02215

zbMATH Keywords

backtrackingconsistencyconstraint satisfactioncutting planesinteger programmingresolution

Mathematics Subject Classification ID

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

Recommendations

• Achieving consistency with cutting planes
• Generalized resolution for 0--1 linear inequalities
• Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
• Constraint Programming
• Persistency in 0-1 polynomial programming

Cited in

(1)

• Achieving consistency with cutting planes

This page was built for publication: Consistency for \(0-1\) programming

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