Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. The computational complexity VCSPs depends on the set allowed cost functions in input. Recently, all for finite sets over domains has been classified. Many natural problems, however, cannot be formulated as domain. We initiate systematic investigation infinite-domain with piecewise linear h...