 |
||||||
| Yoshitsugu Yamamoto and Daisuke Zenke | ||||||
| Key words: | ||||||
| minimum maximal flow, optimization over the efficient set, D.C. optimization, cut and split, global optimization | ||||||
| Mathematices Subject Classification: 90B50, 90C35, 90C57, 90C59 | ||||||
|
||||||
| Yoshitsugu Yamamoto and Daisuke Zenke | ||||||
| Key words: | ||||||
| minimum maximal flow, optimization over the efficient set, D.C. optimization, cut and split, global optimization | ||||||
| Mathematices Subject Classification: 90B50, 90C35, 90C57, 90C59 | ||||||
|
||||||||||||||||||||||||||||||||||||||||
| Abstract: | |||
| This paper is concerned with the minimum maximal flow problem, i.e., a problem of minimizing the flow value attained by a maximal flow for a given network. The optimal value indicates how inefficiently the network can be utilized under restricted controllability. We discuss the extension of the gap function defining the set of all maximal flows and then formulate the problem as a D.C.\ optimization problem. Based on this formulation, we propose the cut and split method combined with a local search technique. | |||
| Cut and Split Method for the Minimum Maximal Flow Problem | |
| Special Issue in Honor of the 65th Birthday of Hiroshi Konno | |||
| Volume 1, Number 2, May 2005, pp. 387-404 | |||