Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
From MaRDI portal
Publication:2905390
DOI10.1613/jair.3598zbMath1254.90309arXiv1401.5855OpenAlexW3101984934MaRDI QIDQ2905390
Stanislav Živný, Martin C. Cooper
Publication date: 27 August 2012
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.5855
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (11)
Tractability in constraint satisfaction problems: a survey ⋮ Modularity-based decompositions for valued CSP ⋮ Discrete convexity in joint winner property ⋮ Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. ⋮ Tractability of explaining classifier decisions ⋮ Hybrid Tractable Classes of Constraint Problems ⋮ The Complexity of Valued CSPs ⋮ A Tractable Class of Binary VCSPs via M-Convex Intersection ⋮ Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns ⋮ Variable and value elimination in binary constraint satisfaction via forbidden patterns ⋮ Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems
This page was built for publication: Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
