- 2.1 Leadingindicator identification
- 3.1 Wagner-Whitin algorithm
- 4.1 DP for finitehorizon inventory problem
- 4.2 Exact algorithm for periodicreview (s, S) policies with discrete demand distribution (Zheng and Federgruen 1991)
- 5.1 Iterative algorithm for EIL approximation for (r, Q) policy
- 5.2 Exact algorithm for continuousreview (r, Q) policy with continuous demand distribution
- 5.3 Exact algorithm for continuousreview (r, Q) policy with discrete demand distribution (Federgruen and Zheng 1992)
- 6.1 Relabel stages
- 6.2 DP algorithm for tree SSSPP
- 8.1 Solve (UFLP-Lrλ)
- 8.2 Get feasible solution for UFLP from solution to (UFLP-LRλ)
- 8.3 Lagrangian relaxation algorithm for UFLP
- 8.4 Dualascent procedure for DUALOC algorithm
- 8.5 Dualadjustment procedure for DUALOC algorithm
- 8.6 Greedyadd heuristic for UFLP
- 8.7 Swap heuristic for pMP
- 8.8 Neighborhood search heuristic for pMP
- 8.9 SCLPbased algorithm for pCP
- 8.10 1-Center on a tree
- 8.11 2-Center on a tree
- 10.1 Nearest neighbor heuristic
- 10.2 Nearest insertion heuristic
- 10.3 Cheapest insertion heuristic
- 10.4 GENI heuristic
- 10.5 MST heuristic
- 10.6 Christofides' heuristic
- 11.1 Set coveringbased algorithm for VRP
- 11.2 Clarke-Wright savings heuristic
- 11.3 Randomized Clarke-Wright savings heuristic
- 11.4 Sweep heuristic
- 11.5 Locationbased heuristic for VRP
- 12.1 Solve (P'j)
- D.1 Lagrangian relaxation
..................Content has been hidden....................
You can't read the all page of ebook, please click
here login for view all page.