The Analysis of Solution Efficiency under Different Constraint Tightness for GAP
碩士 === 國立臺北科技大學 === 商業自動化與管理研究所 === 97 === In the real world, many decision-making problems are related to the Generalized Assignment Problem（GAP）. GAP is a combinatorial problem that belongs to NP-hard. In addition to problem scale, constraint tightness is also a significant factor that affects pro...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/835874 |