A Method Solving Integer Linear Programming Problems with Branch & Bound Procedure
碩士 === 國立中正大學 === 資訊管理學系 === 93 === Integer Linear Programming (ILP) problems are harder to solve than Linear Programming (LP) problems. One should not merely round the results of Linear Programming problems and claim they are the optimum solution. We propose a revised method solving ILP problems wi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/91327125074487156119 |