Solving the Sum-of-Ratios Problem byStochastic Search Algorithm
碩士 === 國立成功大學 === 數學系應用數學碩博士班 === 93 === In spite of recent progress in fractional programming, the sum-of-ratios problem remains untoward. Freund and Jarre proved that this is an NP-complete problem. Most of the existing methods overcome the difficulty using the determ...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/02654251841867886727 |