• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Maximizing a non-decreasing non-submodular function subject to various types of constraints.

Cheng LuWenguo YangRuiqi YangSuixiang Gao
Published in: J. Glob. Optim. (2022)
Keyphrases
  • submodular functions
  • greedy algorithm
  • constraint satisfaction
  • neural network
  • convex optimization
  • facility location problem