Exploiting subproblem dominance in constraint programming
From MaRDI portal
Publication:453591
DOI10.1007/S10601-011-9112-9zbMATH Open1247.68249OpenAlexW2095067556MaRDI QIDQ453591FDOQ453591
Geoffrey Chu, Maria Garcia De La Banda, Peter J. Stuckey
Publication date: 27 September 2012
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-011-9112-9
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Propagation via lazy clause generation
- Caching Search States in Permutation Problems
- Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
- Dynamic programming to minimize the maximum number of open stacks
- Title not available (Why is that?)
- Conditional Symmetry Breaking
- Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
Cited In (10)
- Caching Search States in Permutation Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Solving subgraph isomorphism problems with constraint programming
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
- Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
- Automated streamliner portfolios for constraint satisfaction problems
- Exploiting functional constraints in automatic dominance breaking for constraint optimization
- Automatically exploiting subproblem equivalence in constraint programming
- Compiling CP subproblems to MDDs and d-DNNFs
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Uses Software
This page was built for publication: Exploiting subproblem dominance in constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453591)
