Recognition problems for special classes of polynomials in 0-1 variables
From MaRDI portal
Recommendations
- On a Special Class of Polynomials
- On some special polynomials
- A polynomial recognition of unit forms
- On a problem in the theory of polynomials
- scientific article; zbMATH DE number 3875705
- scientific article; zbMATH DE number 3353355
- Polynomials of certain special types
- Publication:4863285
- Certain extremal problems for polynomials
- ON THE ZEROS OF RECURSIVELY DEFINED POLYNOMIALS
Cites work
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3641502 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A note on the monotonicity of pseudo-Boolean functions
- Discrete optimization on a multivariable boolean lattice
- From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
- Hill Climbing with Multiple Local Optima
- Low order polynomial bounds on the expected performance of local improvement algorithms
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- Methods of Nonlinear 0-1 Programming
- Minimum cuts, modular functions, and matroid polyhedra
- On submodular function minimization
- On the supermodular knapsack problem
- Recognition of a class of unimodular functions
- The ellipsoid method and its consequences in combinatorial optimization
- Unimodular functions
Cited in
(22)- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
- Pseudo-Boolean optimization
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Global optimization of nonconvex problems with multilinear intermediates
- Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
- The expressive power of binary submodular functions
- MIP relaxations in factorable programming
- Recognition of a class of unimodular functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- Tractable relaxations of composite functions
- Concave extensions for nonlinear 0-1 maximization problems
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
- Tabu search-based metaheuristic algorithm for software system reliability problems
- Recognizing ℙnin Classical and Modern Setting
- A cross entropy based algorithm for reliability problems
- The Expressive Power of Binary Submodular Functions
- Unimodular functions
- On the geometric separability of Boolean functions
- Classes of submodular constraints expressible by graph cuts
- Generalized roof duality
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
This page was built for publication: Recognition problems for special classes of polynomials in 0-1 variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121786)
