Pages that link to "Item:Q3638082"
From MaRDI portal
The following pages link to Tractable Optimization Problems through Hypergraph-Based Structural Restrictions (Q3638082):
Displaying 12 items.
- Structural decompositions for problems with global constraints (Q272005) (← links)
- A hypergraph framework for optimal model-based decomposition of design problems (Q1366302) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
- The structured H<sub>2</sub>-optimization problem (Q4844527) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- Coalition formation in social environments with logic-based agents1 (Q5145446) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- Computing a partition function of a generalized pattern-based energy over a semiring (Q6174653) (← links)