Super-reparametrizations of weighted CSPs: properties and optimization perspective
From MaRDI portal
Publication:6049436
DOI10.1007/s10601-023-09343-6arXiv2201.02018OpenAlexW4376644557MaRDI QIDQ6049436
Simon de Givry, Tomáš Dlask, Tomáš Werner
Publication date: 15 September 2023
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.02018
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing and restoring global inverse consistency in interactive constraint satisfaction
- On minimal constraint networks
- New order relations in set optimization
- Cyclic consistency: A local reduction operation for binary valued constraints
- Solving weighted CSP by maintaining arc consistency
- Soft arc consistency revisited
- The complexity of facets resolved
- Triangle-based consistencies for cost function networks
- Lattices and ordered algebraic structures
- Pushing the frontier of minimality
- Networks of constraints: Fundamental properties and applications to picture processing
- QPLIB: a library of quadratic programming instances
- Theoretical analysis of singleton arc consistency and its extensions
- Efficient algorithms for singleton arc consistency
- A weighted CSP approach to cost-optimal planning
- The Complexity of Finite-Valued CSPs
- Sherali-Adams Relaxations for Valued CSPs
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability
- Graphical Models, Exponential Families, and Variational Inference
- The Complexity of Valued Constraint Satisfaction Problems
- Reducibility among Combinatorial Problems
- Discrete Graphical Models — An Optimization Perspective
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program
- The Power of Linear Programming for General-Valued CSPs
This page was built for publication: Super-reparametrizations of weighted CSPs: properties and optimization perspective
