使用分支定界法以及最小成本最大流量求最小庫存持有成本下之最大訂單允諾數量;Using Branch and Bound Algorithm and Minimum Cost Maximum Flow for Maximizing Committed Order Quantities Under Minimum Holding Cost