Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference19 articles.
1. A. Billionnet and M. Minoux, “Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions,”Discrete Applied Mathematics 12 (1985) 1–11.
2. W.H. Cunningham, “On submodular function minimization,”Combinatorica 5 (1985) 185–192.
3. W.H. Cunningham, “Minimum cuts, modular functions, and matroid polyhedra,”Networks 15 (1985) 205–215.
4. G. Gallo and B. Simeone, “On the supermodular knapsack problem,” preprint (1986).
5. M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman and Company, San Francisco, 1979).
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献