Efficient storage of Pareto points in biobjective mixed integer programming.
Nathan AdelgrenPietro BelottiAkshay GuptePublished in: CoRR (2014)
Keyphrases
- mixed integer programming
- efficient storage
- bi objective
- multi objective
- multi objective optimization
- column generation
- set covering problem
- xml databases
- multiple objectives
- lot sizing
- efficient solutions
- mixed integer
- production planning
- evolutionary algorithm
- genetic algorithm
- nsga ii
- branch and bound
- data points
- convex hull
- hash table
- relational databases
- optimal solution
- high dimensional
- lagrangian relaxation
- shortest path problem
- integer programming
- knapsack problem