Pseudo-Boolean Programming

DOI10.1287/OPRE.17.2.233MaRDI QIDQ5558791zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

operations research

Cited in

(11)

• Application of optimization methods to the hematological support of patients with disseminated malignancies
• Applications of game theory to threshold logic
• Univariate parameterization for global optimization of mixed-integer polynomial problems
• \({\mathfrak R}\)-Netzwerke und Matrixalgorithmen
• On pseudo-Boolean polynomials
• A capacitated competitive facility location problem
• Branch-and-bound algorithm for a competitive facility location problem
• The Collapsing 0–1 Knapsack Problem
• On the competitive facility location problem with a free choice of suppliers
• A revised Taha's algorithm for polynomial 0-1 programming
• An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix

This page was built for publication: Pseudo-Boolean Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558791)