Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
Authors:
- Heesang LeeHeesang Lee
- George L. NemhauserGNGeorge L. Nemhauser
- Yinhua WangYWYinhua Wang
- 11 October 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 94 (1) , 154-166
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- The boolean quadric polytope: Some characteristics, facets and relativesMathematical Programming, 1989
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- The indefinite zero-one quadratic problemDiscrete Applied Mathematics, 1984
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978
- Local Unimodularity in the Matching Polytope1978
- A class of facet producing graphs for vertex packing polyhedraDiscrete Mathematics, 1975
- On the facial structure of set packing polyhedraMathematical Programming, 1973