论文信息 - Unimodular functions - 字舞流文

Unimodular functions

Pierre Hansen | Bruno Simeone | P. Hansen | B. Simeone

[1] Alain Billionnet,et al. Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions , 1985, Discret. Appl. Math..

[2] P. Hammer,et al. Quasimonotone Boolean Functions and Bistellar Graphs , 1980 .

[3] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[4] S. N. Maheshwari,et al. An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] J. Picard. Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .

[7] H. D. Ratliff,et al. Minimum cuts and related problems , 1975, Networks.

[8] P. Hammer,et al. Linear Decomposition of a Positive Group-Boolean Function , 1974 .

[9] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[10] J. Rhys. A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[11] M. Balinski. Notes—On a Selection Problem , 1970 .

[12] M. Desu. A Selection Problem , 1970 .

[13] Peter L. Hammer,et al. Boolean Methods in Operations Research and Related Areas , 1968 .

[14] A. Hoffman,et al. On unimodular matrices , 1962 .

[15] F. Harary. On the notion of balance of a signed graph. , 1953 .