A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs.
Alvaro Sierra-AltamirandaHadi CharkhgardPublished in: INFORMS J. Comput. (2019)
Keyphrases
- bi objective
- efficient solutions
- set covering problem
- minimum cost flow
- optimal solution
- multi objective
- heuristic methods
- cost function
- ant colony optimization
- shortest path problem
- set covering
- pareto optimal solutions
- dynamic programming
- optimization algorithm
- convex hull
- knapsack problem
- computational complexity
- spanning tree
- network design
- search space
- objective function