The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
From MaRDI portal
Publication:5032030
Recommendations
- The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
- The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
- Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation
- The power of linear programming for general-valued CSPs
Cited in
(3)
This page was built for publication: The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032030)