A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints.评价结果

评估详情