An algorithm for optimal shipments with given frequencies
研究在有限运输频率下，如何最小化多产品从产地到目的地的运输与库存总成本，建立了NP难的混合整数规划模型，并设计了分支定界算法。
This article deals with the problem of minimizing the transportation and inventory cost associated with the shipment of several products from a source to a destination, when a finite set of shipping frequencies is available. A mixed-integer programming model—shown to be NP-hard—is formulated for that problem. The computational complexity of some similar models applied to different problems is also investigated. In particular, whereas the capacitated plant location problem with operational cost in product form is NP-hard, the simple plant location problem with the same characteristics can be solved in polynomial time. A branch-and-bound algorithm is finally worked out, and some computational results are presented. © 1996 John Wiley & Sons, Inc.