scientific article; zbMATH DE number 7533337
From MaRDI portal
Publication:5079734
DOI10.4230/LIPICS.CSL.2018.12MaRDI QIDQ5079734FDOQ5079734
Marcello Mamino, Manuel Bodirsky, C. Viola
Publication date: 28 May 2022
Full work available at URL: https://arxiv.org/abs/1804.01710
Title of this publication is not available (Why is that?)
optimisationconstraint satisfactionmodel theorypiecewise linear functionssemilinearsubmodular functionsvalued constraint satisfaction problems
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- The Power of Linear Programming for General-Valued CSPs
- Algebraic Properties of Valued Constraint Satisfaction Problem
- Min CSP on Four Elements: Moving beyond Submodularity
Cited In (1)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079734)