Bi-dimensional knapsack problems with one soft constraint.
Britta SchulzeLuís PaqueteKathrin KlamrothJosé Rui FigueiraPublished in: Comput. Oper. Res. (2017)
Keyphrases
- knapsack problem
- soft constraints
- multiple objectives
- hard constraints
- constraint satisfaction
- business intelligence
- constraint satisfaction problems
- combinatorial optimization problems
- np hard
- dynamic programming
- max csp
- optimization problems
- linear programming relaxation
- test problems
- constraint propagation
- optimal solution
- production planning
- exact algorithms
- arc consistency
- greedy algorithm
- bicriteria
- constraint problems
- machine learning
- integer programming
- np complete
- lower bound
- hard and soft constraints