Redundant modeling in permutation weighted constraint satisfaction problems

DOI10.1007/S10601-009-9075-2zbMath1208.68202OpenAlexW1974920664MaRDI QIDQ606896

M. H. C. Woo, Yat Chiu Law, Jimmy Ho-man Lee

Publication date: 19 November 2010

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-009-9075-2

zbMATH Keywords

constraint optimizationmodel redundancyWCSPweighted constraint satisfaction

Mathematics Subject Classification ID

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

Uses Software

• CSPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving weighted CSP by maintaining arc consistency
• Nondeterministic control for hybrid search
• Consistency in networks of relations
• Increasing constraint propagation by redundant modeling: An experience report
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Local search-based hybrid algorithms for finding Golomb rulers
• Automatic generation of redundant models for permutation constraint satisfaction problems
• Permutation Problems and Channelling Constraints
• An Automatic Method of Solving Discrete Programming Problems
• Hybrid Algorithms in Constraint Programming
• Semiring-based constraint satisfaction and optimization
• Nondeterministic Control for Hybrid Search
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Redundant modeling in permutation weighted constraint satisfaction problems