Pages that link to "Item:Q3614209"

The following pages link to Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction (Q3614209):

Displaying 14 items.

• Colouring, constraint satisfaction, and complexity (Q458466) (← links)
• On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) (← links)
• Supermodular programming on lattices (Q1411563) (← links)
• Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
• A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
• The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
• (Q3773931) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• Technical Note—Preservation of Supermodularity in Parametric Optimization Problems with Nonlattice Structures (Q5166272) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• Algorithms for maximization of supermodular functions and their application in the optimization of grouping provinces in a region (Q5932864) (← links)