Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation | 0 | 0.34 | 2022 |
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains | 0 | 0.34 | 2021 |
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains | 0 | 0.34 | 2020 |
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. | 0 | 0.34 | 2018 |