scientific article; zbMATH DE number 3212646

zbMath0131.18503MaRDI QIDQ5339894

Sergiu Rudeanu, Peter L. Hammer, Ivo G. Rosenberg

Publication date: 1963

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

operations research

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (19)

Disjunctive analogues of submodular and supermodular pseudo-Boolean functions ⋮ The struction algorithm for the maximum stable set problem revisited ⋮ Introduction to QUBO ⋮ Equivalent constraints for discrete sets ⋮ Discrete function expansions in integer powers ⋮ Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks ⋮ Quasi-optimal recombination operator ⋮ Properties of quasi-Boolean function on quasi-Boolean algebra ⋮ On the complexity of binary polynomial optimization over acyclic hypergraphs ⋮ The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds ⋮ Berge-acyclic multilinear 0-1 optimization problems ⋮ A class of valid inequalities for multilinear 0-1 optimization problems ⋮ Pseudo-Boolean optimization ⋮ The basic algorithm for pseudo-Boolean programming revisited ⋮ Compact quadratizations for pseudo-Boolean functions ⋮ Transformation of integer programs to knapsack problems ⋮ Special issue: Boolean functions and related problems ⋮ Disjunctive and conjunctive normal forms of pseudo-Boolean functions ⋮ Application of pseudo-Boolean programming to the theory of graphs

This page was built for publication: