articleOperations Research LettersJun 2, 2003Closed access

A note on maximizing a submodular set function subject to a knapsack constraint

MSMaxim Sviridenko
Indexed incrossref

Abstract

No abstract available for this paper.

Citation impact

690
total citations
FWCI
1.09
Percentile
100%
References
8
Citations per year

Authors

1

Topics & keywords

Topics
Keywords
  • Submodular set function
  • Knapsack problem
  • Constraint (computer-aided design)
  • Set (abstract data type)
  • Set function
  • Subject (documents)
  • Mathematics
  • Mathematical optimization
No related works found for this paper.