Pages that link to "Item:Q5396951"

The following pages link to An Algebraic Theory of Complexity for Discrete Optimization (Q5396951):

Displaying 21 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
• On a general framework for network representability in discrete optimization (Q1631628) (← links)
• Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
• Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem (Q1782048) (← links)
• On planar valued CSPs (Q2396724) (← links)
• An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains (Q2674328) (← links)
• THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA (Q2795309) (← links)
• On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
• A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
• Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
• Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
• (Q4993594) (← links)
• Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• The lattice and semigroup structure of multipermutations (Q5063206) (← links)
• Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• The Complexity of General-Valued CSPs (Q5283238) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)