A Column Generation Approach for the Bi-objective Max-min Knapsack Problem.
Cláudio AlvesRaïd MansiTelmo PintoJosé M. Valério de CarvalhoPublished in: ICORES (2012)
Keyphrases
- max min
- knapsack problem
- bi objective
- column generation
- optimal solution
- branch and bound
- linear programming
- linear program
- min max
- np hard
- multiple objectives
- linear programming relaxation
- combinatorial optimization problems
- test problems
- exact algorithms
- efficient solutions
- integer linear programming
- set partitioning
- dynamic programming
- integer programming
- metaheuristic
- constraint programming
- exact solution
- optimization problems
- branch and bound algorithm
- mixed integer programming
- nsga ii
- integer program
- solution quality
- objective function
- lower bound
- lagrangian relaxation
- ant colony optimization
- hill climbing
- feasible solution
- search algorithm
- greedy algorithm
- genetic algorithm
- shortest path problem
- decision variables