Pseudo-Boolean Programming
From MaRDI portal
Publication:5558791
DOI10.1287/opre.17.2.233zbMath0172.43903OpenAlexW4244282153MaRDI QIDQ5558791
Peter L. Hammer, Sergiu Rudeanu
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.2.233
Related Items (11)
On pseudo-Boolean polynomials ⋮ A capacitated competitive facility location problem ⋮ Branch-and-bound algorithm for a competitive facility location problem ⋮ On the competitive facility location problem with a free choice of suppliers ⋮ A revised Taha's algorithm for polynomial 0-1 programming ⋮ Application of optimization methods to the hematological support of patients with disseminated malignancies ⋮ An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix ⋮ Applications of game theory to threshold logic ⋮ The Collapsing 0–1 Knapsack Problem ⋮ \({\mathfrak R}\)-Netzwerke und Matrixalgorithmen ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems
This page was built for publication: Pseudo-Boolean Programming
