Pricing for customers with probabilistic valuations as a continuous knapsack problem.
Michael BenischJames AndrewsNorman M. SadehPublished in: ICEC (2006)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- dynamic programming
- optimal pricing
- bicriteria
- optimization problems
- multidimensional knapsack problem
- greedy algorithm
- np hard
- linear programming relaxation
- production planning
- exact algorithms
- mechanism design
- bayesian networks
- greedy heuristic
- heuristic solution
- pricing strategies
- continuous relaxation
- maximum profit
- metaheuristic
- decision variables
- tabu search
- worst case
- scheduling problem
- lower bound
- integer variables
- search algorithm