Name
Abstract | ||
|---|---|---|
The problem of minimizing the flow value attained by maximal flows plays an important and interesting role to investigate how inefficiently a network can be utilized. It is a typical multiextremal optimization problem, which can have local optima different from global optima. We formulate this problem as a global optimization problem with a special structure and propose a method to combine different techniques in local search and global optimization. Within the proposed algorithm, the advantageous structure of network flow is fully exploited so that the algorithm should be suitable for handling the problem of moderate sizes. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1080/1055678031000120191 | OPTIMIZATION METHODS & SOFTWARE |
Keywords | Field | DocType |
minimum maximal flow,global optimization,optimization over efficient sets,adjacent vertex search,branch and bound | Mathematical optimization,Global optimization,Algorithm,Multi-swarm optimization,Cross-entropy method,Cutting stock problem,Multi-commodity flow problem,Optimization problem,Minimum-cost flow problem,Mathematics,Metaheuristic | Journal |
Volume | Issue | ISSN |
18 | 4 | 1055-6788 |
Citations | PageRank | References |
2 | 0.42 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun-Ya Gotoh | 1 | 117 | 10.17 |
| Nguyen Van Thoai | 2 | 9 | 2.75 |
| Y. Yamamoto | 3 | 103 | 23.02 |