Principles and Practice of Constraint Programming – CP 2004

DOI10.1007/B100482zbMath1152.68556OpenAlexW1508891358MaRDI QIDQ5900299

Meinolf Sellmann, Carla P. Gomes

Publication date: 9 September 2008

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

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

zbMATH Keywords

searchbranching strategiesconstraint reasoning

Mathematics Subject Classification ID

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

Related Items (15)

The existence and application of strongly idempotent self-orthogonal row Latin magic arrays ⋮ An experiment with satisfiability modulo SAT ⋮ The existence of irrational diagonally ordered magic squares ⋮ Computer-aided proof of Erdős discrepancy properties ⋮ Unnamed Item ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ The existence of irrational most perfect magic squares ⋮ Information-theoretic approaches to branching in search ⋮ Unnamed Item ⋮ New ways to multiply \(3 \times 3\)-matrices ⋮ Existence of Yang Hui type magic squares ⋮ Alternating control tree search for knapsack/covering problems ⋮ In search of balance: the challenge of generating balanced Latin rectangles ⋮ Streamlining variational inference for constraint satisfaction problems ⋮ Large-scale parallelism for constraint-based local search: the costas array case study

This page was built for publication: Principles and Practice of Constraint Programming – CP 2004