The following pages link to Pseudo-Boolean Programming (Q5558791):
Displaying 11 items.
- On pseudo-Boolean polynomials (Q267569) (← links)
- Branch-and-bound algorithm for a competitive facility location problem (Q336436) (← links)
- On the competitive facility location problem with a free choice of suppliers (Q463373) (← links)
- Application of optimization methods to the hematological support of patients with disseminated malignancies (Q1220440) (← links)
- Applications of game theory to threshold logic (Q1247809) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- \({\mathfrak R}\)-Netzwerke und Matrixalgorithmen (Q2558833) (← links)
- A capacitated competitive facility location problem (Q3186853) (← links)
- The Collapsing 0–1 Knapsack Problem (Q4175049) (← links)
- A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
- An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix (Q5954079) (← links)
