An exact algorithm for biobjective integer programming problems.
Saliha Ferda DoganÖzlem KarsuFirdevs UlusPublished in: Comput. Oper. Res. (2021)
Keyphrases
- integer programming problems
- bi objective
- shortest path problem
- cutting plane
- linear programming
- artificial bee colony algorithm
- column generation
- shortest path
- branch and bound
- integer programming
- set covering problem
- efficient solutions
- branch and bound algorithm
- multi objective
- knapsack problem
- particle swarm optimization algorithm
- multiple objectives
- minimum cost flow
- exact algorithms
- directed acyclic graph
- combinatorial optimization problems
- optimal solution
- valid inequalities
- lower bound
- multi objective optimization
- directed graph
- ant colony optimization
- search algorithm
- cost function
- mathematical model
- lagrangian relaxation
- network design
- nsga ii