| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4634703 | Applied Mathematics and Computation | 2008 | 7 Pages |
Abstract
This paper develops the goal programming technique to solve the multiple objective assignment problem. The required model is formulated and an appropriate solution method is presented. The proposed method, which is a decomposition method, exploits the total unimodularity feature of the assignment problem and effectively reduces the computational efforts. Some issues related to the efficiency of a GP solution are stated and some specialized techniques for detecting and restoring efficiency are proposed.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
G.R. Jahanshahloo, M. Afzalinejad,