Pages that link to "Item:Q1121786"

The following pages link to Recognition problems for special classes of polynomials in 0-1 variables (Q1121786):

Displaying 19 items.

• Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Generalized roof duality (Q714031) (← links)
• Tabu search-based metaheuristic algorithm for software system reliability problems (Q955616) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• A cross entropy based algorithm for reliability problems (Q1038840) (← links)
• Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
• A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
• Extending shelling orders and a hierarchy of functions of unimodal simple polytopes (Q1894364) (← links)
• On the geometric separability of Boolean functions (Q1917289) (← links)
• Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
• Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
• Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program (Q2450669) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
• Tractable Relaxations of Composite Functions (Q5085133) (← links)
• MIP relaxations in factorable programming (Q6601201) (← links)