An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs.
João C. N. ClímacoMarta M. B. PascoalPublished in: INFOR Inf. Syst. Oper. Res. (2016)
Keyphrases
- linear program
- bicriteria
- efficient solutions
- optimal solution
- extreme points
- bi objective
- linear programming
- minimum cost flow
- strongly polynomial
- integer linear programming
- column generation
- knapsack problem
- simplex method
- feasible solution
- solution quality
- np hard
- objective function
- primal dual
- heuristic methods
- cutting plane
- lp relaxation
- lower bound
- approximate solutions
- branch and bound
- metaheuristic
- finite number
- multi objective
- simplex algorithm
- search space
- hybrid algorithm