Pruning by equally constrained variables

DOI10.1007/B106890MaRDI QIDQ5703908zbMATH OpenOpenAlexFDO

Authors Igor Razgon, Amnon Meisels

Publication date 11 November 2005

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

Full work available at URL https://doi.org/10.1007/b106890

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An optimal constrained pruning strategy for decision trees
• Pruning for the minimum constraint family and for the number of distinct values constraint family
• Pruning by isomorphism in branch-and-cut
• Pruning by isomorphism in branch-and-cut
• Pruning variable selection ensembles
• Optimal pruning in parametric differential equations
• Weighted matching as a generic pruning technique applied to optimization constraints
• Pruning in map-reduce style CbO algorithms

Cited in

(6)

• Pruning by isomorphism in branch-and-cut
• A CSP search algorithm with responsibility sets and kernels
• Gallai-Edmonds decomposition as a pruning technique
• Reasoning by Dominance in Not-Equals Binary Constraint Networks
• Pruning for the minimum constraint family and for the number of distinct values constraint family
• Pruning by isomorphism in branch-and-cut

This page was built for publication: Pruning by equally constrained variables

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