A bi-criteria algorithm for online non-monotone maximization problems: DR-submodular+concave.
Junkai FengRuiqi YangHaibin ZhangZhenning ZhangPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- objective function
- bicriteria
- benchmark problems
- integer linear programming
- learning algorithm
- shortest path problem
- np hard
- computational complexity
- efficient solutions
- piecewise linear
- search space
- knapsack problem
- optimization problems
- space complexity
- simulated annealing
- optimal solution
- shortest path
- combinatorial optimization
- solution quality
- worst case
- special case