Online Knapsack Problem and Budgeted Truthful Bipartite Matching.
Rahul VazePublished in: CoRR (2016)
Keyphrases
- knapsack problem
- bipartite matching
- optimization problems
- combinatorial optimization problems
- dynamic programming
- optimal solution
- online algorithms
- test problems
- online learning
- exact algorithms
- np hard
- multiple objectives
- multidimensional knapsack problem
- maximum weight
- multi class
- greedy heuristic
- maximum profit
- continuous relaxation
- neural network
- lower bound
- computational complexity
- bi objective
- greedy algorithm
- shortest path
- graphical models
- scheduling problem
- evolutionary algorithm
- minimum cost flow
- implicit enumeration
- reinforcement learning