| Presentation | 2007-01-25 D. C. Optimization Approaches to Minimum Maximal Network Flow Problem Jianming SHI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We consider the minimum maximal flow problem, i.e., minimizing the flow value among maximal flow, which is an NP-hard problem. This problem is formulated as an optimization problem over the Pareto set of a linear vector program. We use a d.c. optimization formulation of the problem to obtain solution methods for the problem. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | minimum maximal flow / d. c. optimization / branch-and-bound / DCA algorithm |
| Paper # | NC2006-98 |
| Date of Issue |
| Conference Information | |
| Committee | NC |
|---|---|
| Conference Date | 2007/1/18(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Neurocomputing (NC) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | D. C. Optimization Approaches to Minimum Maximal Network Flow Problem |
| Sub Title (in English) | |
| Keyword(1) | minimum maximal flow |
| Keyword(2) | d. c. optimization |
| Keyword(3) | branch-and-bound |
| Keyword(4) | DCA algorithm |
| 1st Author's Name | Jianming SHI |
| 1st Author's Affiliation | Department of Computer Science and Systems Engineering Muroran Institute of Technology() |
| Date | 2007-01-25 |
| Paper # | NC2006-98 |
| Volume (vol) | vol.106 |
| Number (no) | 500 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |