The following pages link to (Q5339894):
Displaying 24 items.
- Pseudo-Boolean optimization (Q697569) (← links)
- Equivalent constraints for discrete sets (Q1135780) (← links)
- Discrete function expansions in integer powers (Q1136230) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- The struction algorithm for the maximum stable set problem revisited (Q1332429) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Special issue: Boolean functions and related problems (Q1841878) (← links)
- Disjunctive and conjunctive normal forms of pseudo-Boolean functions (Q1841879) (← links)
- Disjunctive analogues of submodular and supermodular pseudo-Boolean functions (Q1878401) (← links)
- Properties of quasi-Boolean function on quasi-Boolean algebra (Q1937909) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
- Compact quadratizations for pseudo-Boolean functions (Q2307493) (← links)
- A derivation of the number of minima of the Griewank function (Q2518647) (← links)
- Transformation of integer programs to knapsack problems (Q2547181) (← links)
- (Q4373300) (← links)
- Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks (Q4591238) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Application of pseudo-Boolean programming to the theory of graphs (Q5516545) (← links)
- Quasi-optimal recombination operator (Q6084518) (← links)
- (Q6137264) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
- Short paper -- The binary linearization complexity of pseudo-Boolean functions (Q6633276) (← links)
