A submodular-based decomposition strategy for valued CSPs (original) (raw)
Related papers
Submodularity-Based Decomposing for Valued CSP
International Journal on Artificial Intelligence Tools, 2013
A decomposition method for valued CSPs
Domain permutation reduction for Valued CSPs
2011
Valued Constraint Satisfaction Problems: Hard and Easy Problems
1995
Binarisation for Valued Constraint Satisfaction Problems
SIAM Journal on Discrete Mathematics, 2017
Hybrid tractability of valued constraint problems
Artificial Intelligence, 2011
Domain Reduction for Valued Constraints by Generalising Methods from CSP
Principles and Practice of Constraint Programming, 2018
Soft Directional Substitutable based Decompositions for MOVCSP
In Proceedings of the 10th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-485-5, pages 218-225. , 2021
Eliminating redundancy in CSPs through merging and subsumption of domain values
ACM SIGAPP Applied Computing Review, 2013
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Lecture Notes in Computer Science, 2010
Hybrid Tractable Classes of Constraint Problems
2017
Extended Formulations for MINLP Problems by Value Decompositions
2008
High-Order Consistency in Valued Constraint Satisfaction
Constraints, 2005
On the encoding of constraint satisfaction problems with 0/1 variables
2001
Reformulating constraint satisfaction problems to improve scalability
2007
Artificial Intelligence, 2016
Conditional and Composite Constraints with Preferences
2008
Mixed-Integer Programming Approaches to Generalized Submodular Optimization and its Applications
arXiv (Cornell University), 2023
A Decomposition Technique for Solving {Max-CSP}
Quantitative Logic and Soft Computing 2016, 2016
Exploiting the Structure of Constraint Satisfaction Problems by Interchangeability
2001
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM, 2008
When the Decomposition Meets the Constraint Satisfaction Problem
2020
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
2008
A filtering technique to achieve 2-consistency in constraint satisfaction problems
2012
The partial constraint satisfaction problem: Facets and lifting theorems
Operations Research Letters, 1998
A principled approach to mixed integer/linear problem formulation
Operations Research and Cyber-Infrastructure (ICS Proceedings), 2009
Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs
2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), 2017
Cyclic consistency: A local reduction operation for binary valued constraints
Artificial Intelligence, 2004
Lexicographically-Ordered Constraint Satisfaction Problems
Constraints, 2010