|
|||||
|
|
Polyhedral results for a class of cardinality constrained submodular minimization problems |
|
| Affiliation: | 1. College of Computing, Georgia Institute of Technology, Atlanta, GA 30332, United States;2. School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, United States |
| Abstract: |  |
| Keywords: | Cardinality constraint Submodular minimization Conic integer programming Cutting planes |
| 本文献已被 ScienceDirect 等数据库收录！ | |