An exact algorithm for a cross-docking supply chain network design problem.
C. S. SungW. YangPublished in: J. Oper. Res. Soc. (2008)
Keyphrases
- network design problem
- distribution centers
- supply chain
- integer programming
- branch and bound
- mixed integer programming
- column generation
- network design
- branch and bound algorithm
- approximation algorithms
- supply chain management
- transportation networks
- minimal cost
- bullwhip effect
- np hard
- upper bound
- lagrangian relaxation
- mixed integer
- lead time
- lot sizing
- decision making
- service level
- production planning
- search space
- search algorithm
- road network
- exact solution
- data mining
- optimal solution