Pages that link to "Item:Q1069444"

The following pages link to Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444):

Displaying 24 items.

• Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
• An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Minimizing a sum of submodular functions (Q713320) (← links)
• Generalized roof duality (Q714031) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• Unimodular functions (Q1079493) (← links)
• On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347) (← links)
• Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
• A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
• On a general framework for network representability in discrete optimization (Q1631628) (← links)
• On the supermodular knapsack problem (Q1824552) (← links)
• A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization (Q2193277) (← links)
• Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings (Q2193778) (← links)
• Recognition of a class of unimodular functions (Q2638932) (← links)
• On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
• The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
• The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
• Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
• A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)