An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing.
Leizer de Lima PintoKátia Cilene Costa FernandesKleber Vieira CardosoNelson MaculanPublished in: Comput. Oper. Res. (2019)
Keyphrases
- network flow
- integer programming
- bi objective
- routing problem
- efficient solutions
- multi objective
- set covering problem
- linear programming
- np hard
- network design
- multi objective optimization
- shortest path problem
- lagrangian relaxation
- ant colony optimization
- constraint programming
- shortest path
- set covering
- integer program
- routing algorithm
- knapsack problem
- multiple objectives
- valid inequalities
- vehicle routing problem
- column generation
- optimization algorithm
- evolutionary algorithm
- minimum cost
- nsga ii
- particle swarm optimization
- lower bound
- global optimization
- linear program
- routing protocol
- computational complexity