Solving knapsack problems with S-curve return functions.
Semra AgraliJoseph GeunesPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- knapsack problem
- randomly generated test instances
- implicit enumeration
- optimization problems
- combinatorial optimization problems
- optimal solution
- test problems
- exact algorithms
- linear relaxation
- binary variables
- greedy algorithm
- dynamic programming
- integer variables
- production planning
- b spline
- linear programming relaxation
- neural network
- np hard
- bicriteria
- np hard problems
- cutting plane
- maximum profit
- combinatorial optimization
- linear functions
- endpoints
- worst case