Collaborative Planning in Supply Chains by Lagrangian Relaxation.
Lanshun NieXiaofei XuDe-chen ZhanPublished in: IMSCCS (2) (2006)
Keyphrases
- supply chain
- lagrangian relaxation
- supply chain management
- integer programming
- lower bound
- feasible solution
- branch and bound algorithm
- lower and upper bounds
- bullwhip effect
- np hard
- dynamic programming
- decision making
- column generation
- inventory management
- mixed integer programming
- service level
- linear programming
- lead time
- shortest path
- inventory control
- discrete event simulation
- revenue sharing
- production planning
- branch and bound
- optimal solution
- valid inequalities
- heuristic search
- tabu search
- inventory policy
- trading partners
- small and medium enterprises
- upper bound