The following pages link to Unimodular functions (Q1079493):
Displaying 22 items.
- Selecting a discrete portfolio (Q478119) (← links)
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Unary functions (Q896066) (← links)
- Tennenbaum's theorem and unary functions (Q929636) (← links)
- A pseudo-Boolean consensus approach to nonlinear 0-1 optimization (Q955309) (← links)
- Strong unimodularity for matrices and hypergraphs (Q1104339) (← links)
- On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347) (← links)
- Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- Maximal unimodular systems of vectors (Q1306930) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Recognition of a class of unimodular functions (Q2638932) (← links)
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651) (← links)
- Iterative Auction Design for Tree Valuations (Q3465578) (← links)
- On dependent randomized rounding algorithms (Q4645933) (← links)
