Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
In this study of a transportation problem of an electronic manufacturer in Hong Kong, we present a cross-border transportation model, analyze its characteristics, and provide solution methods for the problem. The proposed solution methods are applied to the manufacturer's cross-border transportation problem and a variety of similar problems. Our computational results not only illustrate the quality of our solutions but also they provide valuable management insights for the company in their cross-border transportation decisions.