This paper proposes a new heuristicmethod for the logistics network design and planning problem based on linear relaxation and DC (difference of convex functions) programming. We consider a multi-period, multi-echelon,multi-commodity andmulti-product problemdefined as a large scalemixed integer linear programming (MILP) model. The method is experimented on data sets of various size. The numeric...

symmetry detection and decision diagram variable reordering. Although some good results have been obtained thusfar, these research eeorts are ongoing. Acknowledgment The authors would like to thank Professor D. M. Miller for discussions concerning the probability calculation algorithms using DDs. been developed. The tool utilizes an OBDD representation of the logic function as input and iterati...

the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...