A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem.
Fumiaki TaniguchiTakeo YamadaSeiji KataokaPublished in: Int. J. Comput. Math. (2009)
Keyphrases
- max min
- knapsack problem
- bicriteria
- optimization problems
- min max
- optimal solution
- dynamic programming
- combinatorial optimization problems
- exact algorithms
- cutting plane
- robust optimization
- greedy algorithm
- multiple objectives
- efficient solutions
- np hard
- integer variables
- shortest path problem
- branch and bound algorithm
- lp relaxation
- evolutionary algorithm
- genetic algorithm ga
- linear programming
- simulated annealing
- objective function
- neural network