1 |
Agarwal, Y., K. Mathur, and H.M. Salkin, 'A Set-Partitioning-Based Exact Algorithm for the Vehicle Routing Problem,' Networks, Vol.19(1989), pp.731-749
DOI
|
2 |
Clarke, G. and J. Wright, 'Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,' Operations Research, Vol.12(1964), pp.568-581
DOI
ScienceOn
|
3 |
Sung, C.S. and H.W. Jin, 'Dual-based Approach for a Hub Network Design Problem under Non-restrictive Policy,' European Journal of the Operational Research, Vol.132 (2001), pp.88-105
DOI
ScienceOn
|
4 |
Sung, C.S. and S.H. Song, 'Integrated Service Network Design for a Srossdocking Supply Chain Network,' Journal of the Operational Research Society, Vol. 54(2003), pp.1283-1295
DOI
ScienceOn
|
5 |
Desrosiers, J., F. Soumis, and M. Desrochers, 'Routing with Time Windows by Column Generation,' Networks, Vol.14(1984), pp.545-565
DOI
ScienceOn
|
6 |
Bramel, J. and D. Simchi-Levi, 'Location Based Heuristic for General Routing Problems,' Operations Research, Vol.43(1995), pp.649-600
DOI
ScienceOn
|
7 |
Fisher, M.L., 'Optimal Solution of Vehicle Routing Problems Using Minimal K -trees,' Operations Research, Vol.42, No.4(1994), pp.626-640
DOI
ScienceOn
|
8 |
Powell, W.B. and Y. Sheffi, 'Design and Implementation of a Interactive Optimization System for Network Design In the Motor Carrier Industry,' Operations Research, Vol. 37(1989), pp.12-29
DOI
ScienceOn
|
9 |
Stalk, G.P. and L.E. Shulman, 'Competing on Capabilities : The New Role of Corporate Strategy,' Harvard Business Review, Vol. 70(1992), pp.57-69
|
10 |
Armacost, A.P., C. Barnhart, and K.A. Ware, 'Composite Variable Formulations for Express Shipment Service Network Design,' Transportation Science, Vol.36(2002), pp.1-20
DOI
ScienceOn
|
11 |
Fisher, M. and R. Jaikumar, 'A Generalized Assignment Heuristic for Vehicle Routing', Networks, Vol.11, No.2(1981), pp. 109-124
DOI
|
12 |
Aykin, T., 'Networking Policies for Huband-Spoke Systems with Application to the Air Transportation System,' Transportation Science, Vol.29(1995), pp.201- 220
DOI
|
13 |
Kim, D., C. Barnhart, K. ware, and, G. Reinhardt, 'Multimodal Express Package Delivery : A Service Network Design Application,' Transportation Science, Vol.33(1999), pp.391-407
DOI
|
14 |
Liu, F.-H. and S.Y. Shen, 'The Fleet Size and Mix Vehicle Routing Problem with Time Windows,' Jornal of Operational research Society, Vol.50(1999), pp.721-732
DOI
|
15 |
Minoux, M., 'Network Synthesis and Optimum Network Design Problems : Models, Solution Methods and Applications,' Network, Vol.19(1989), pp.313-360
DOI
|
16 |
Apte, U.M. and S. Viswanathan, 'Effective Cross Docking for Improving Distribution Efficiencies,' International Jouranl of Logistics, Vol.3(2000), pp.291-302
DOI
ScienceOn
|
17 |
Golden, B.L., A. Asad, L. Levy, and F.G. Gheysins, 'The Fleet Size and Mix Vehicle Routing,' Networks, Vol.7(1984), pp.113-148
DOI
ScienceOn
|
18 |
Powell, W.B., 'A Local Improvement Heuristic for the Design of Less-thanTruckload Motor Carrier Networks,' Transportation Science, Vol.20(1986), pp.246-257
DOI
ScienceOn
|
19 |
Desrochers, M. and T.W. Verhoog, 'A New Heuristic for the Fleet Size and Mix Vehicle Routing Problem,' Computers end Operations Research, Vol.18(1991), pp.263-274
DOI
ScienceOn
|
20 |
Fisher, M.L., 'A Polynomial Algorithm for the Degree-constrained Minimal K-tree Problem,' Operations Research, Vol.42, No.4 (1994), pp.775-779
DOI
ScienceOn
|