scientific article; zbMATH DE number 2084698

zbMath1067.68633MaRDI QIDQ4475622

Michela Milano, Filippo Focacci

Publication date: 9 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2239/22390077.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Symmetry breaking constraints for value symmetries in constraint satisfaction, Symmetry definitions for constraint satisfaction problems, Predicting and detecting symmetries in FOL finite model search, Towards breaking more composition symmetries in partial symmetry breaking, The Relation Between Complete and Incomplete Search, Local Symmetry Breaking During Search in CSPs, Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance, Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver, A CSP search algorithm with responsibility sets and kernels, A branch-and-bound algorithm for hard multiple knapsack problems, Static and dynamic structural symmetry breaking, Solving Kirkman's schoolgirl problem in a few seconds, Symmetry breaking revisited, A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling, Dynamic structural symmetry breaking for constraint satisfaction problems, \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver, Reasoning from last conflict(s) in constraint programming, Lightweight dynamic symmetry breaking, Dominance breaking constraints