Linked e-resources
Details
Table of Contents
1. Introduction
I. Performance analysis techniques
2. Convexity and supermodularity
3. Worst-case analysis
4. Average-case analysis
5. Mathematical programming based bounds
II. Inventory models
6. Economic lot size models with constant demands
7. Economic lot size models with varying demands
8. Stochastic inventory models
9. Integration of inventory and pricing
III. Design and coordination models
10. Procurement contracts
11. Supply chain planning models
12. Facility location models
IV. Vehicle routing models
13. The capacitated VRP with equal demands
14. The capacitated VRP with unequal demands
15. The VRP with time window constraints
16. Solving the VRP using a column generation approach
V. Logistics algorithms in practice
17. Network planning
18. A case study : school bus routing
19. References.
I. Performance analysis techniques
2. Convexity and supermodularity
3. Worst-case analysis
4. Average-case analysis
5. Mathematical programming based bounds
II. Inventory models
6. Economic lot size models with constant demands
7. Economic lot size models with varying demands
8. Stochastic inventory models
9. Integration of inventory and pricing
III. Design and coordination models
10. Procurement contracts
11. Supply chain planning models
12. Facility location models
IV. Vehicle routing models
13. The capacitated VRP with equal demands
14. The capacitated VRP with unequal demands
15. The VRP with time window constraints
16. Solving the VRP using a column generation approach
V. Logistics algorithms in practice
17. Network planning
18. A case study : school bus routing
19. References.