Pages that link to "Item:Q1121786"
From MaRDI portal
The following pages link to Recognition problems for special classes of polynomials in 0-1 variables (Q1121786):
Displayed 9 items.
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Tabu search-based metaheuristic algorithm for software system reliability problems (Q955616) (← 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)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)