Decomposing Global Grammar Constraints

DOI10.1007/978-3-540-74970-7_42zbMath1145.68529OpenAlexW2137811792MaRDI QIDQ3523078

Toby Walsh, Claude-Guy Quimper

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_42

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42)

Related Items (16)

Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling ⋮ Branch-and-Price for Personalized Multiactivity Tour Scheduling ⋮ Combining Benders decomposition and column generation for multi-activity tour scheduling ⋮ A two-stage stochastic programming approach for multi-activity tour scheduling ⋮ A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem ⋮ Formal languages for integer programming modeling of shift scheduling problems ⋮ MDD propagators with explanation ⋮ Analyzing Context-Free Grammars Using an Incremental SAT Solver ⋮ GAC Via Unit Propagation ⋮ The Weighted Cfg Constraint ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ The weighted grammar constraint ⋮ A large neighbourhood search approach to the multi-activity shift scheduling problem ⋮ Grammar constraints ⋮ Orbital shrinking: theory and applications ⋮ Propagation complete encodings of smooth DNNF theories

This page was built for publication: Decomposing Global Grammar Constraints