An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing.

Leizer de Lima Pinto,Kátia Cilene Costa Fernandes,Kleber Vieira Cardoso,Nelson Maculan

Computers & Operations Research（2019）

引用 7|浏览7

暂无评分

摘要

•Load balancing strategies are needed to improve performance, and make effective use of the network capillarity.•The unfairness in the path length caused by the load balancing has little effect in general.•Our exact approach is a valuable tool for evaluating heuristic solutions.

查看译文

关键词

Polynomial time,Network flow routing problem,Bi-objective optimization,ϵ-constraint technique

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要