Name
Title | ||
|---|---|---|
An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing. |
Abstract | ||
|---|---|---|
•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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cor.2019.02.004 | Computers & Operations Research |
Keywords | Field | DocType |
Polynomial time,Network flow routing problem,Bi-objective optimization,ϵ-constraint technique | Flow network,Mathematical optimization,Polynomial,Path length,Network Load Balancing,Shortest path problem,Integer programming,Wireless mesh network,Wireless sensor network,Mathematics | Journal |
Volume | ISSN | Citations |
106 | 0305-0548 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leizer de Lima Pinto | 1 | 2 | 0.70 |
| Kátia Cilene Costa Fernandes | 2 | 0 | 0.34 |
| Kleber Vieira Cardoso | 3 | 36 | 11.81 |
| Nelson Maculan | 4 | 812 | 66.09 |