메뉴 건너뛰기
INFORMS Journal on Computing
Volumn 22, Issue 2, 2010, Pages 326-337
The uncapacitated time-space fixed-charge network flow problem: An empirical investigation of procedures for arc capacity assignment
Author keywords

Integer programming; Logistics; Network optimization
Indexed keywords

EID: 77952044915     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0354     Document Type: Article
Times cited : (21)
References (63)
  • 1
    • 33748296358 scopus 로고    scopus 로고
    • More-forless algorithm for fixed-charge transportation problems
    • Adlakha, V., K. Kowalski, R. Vemuganti, B. Lev. 2007. More-forless algorithm for fixed-charge transportation problems. Omega 35(1) 116-127.
    • (2007) Omega , vol.35 , Issue.1 , pp. 116-127
    • Adlakha, V.1    Kowalski, K.2    Vemuganti, R.3    Lev, B.4
  • 3
    • 16244412317 scopus 로고    scopus 로고
    • A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem
    • Alidaee, B., G. A. Kochenberger. 2005. A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem. Transportation Sci. 39(1) 140-143.
    • (2005) Transportation Sci. , vol.39 , Issue.1 , pp. 140-143
    • Alidaee, B.1    Kochenberger, G.A.2
  • 4
    • 0024735314 scopus 로고
    • Dual-ascent procedure for large-scale uncapacitated network design
    • Balakrishnan, A., T. L. Magnanti, R. T. Wong. 1989. Dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. 37(5) 716-740.
    • (1989) Oper. Res. , vol.37 , Issue.5 , pp. 716-740
    • Balakrishnan, A.1    Magnanti, T.L.2    Wong, R.T.3
  • 5
    • 0019562317 scopus 로고
    • A new optimization method for large scale fixed charge transportation problems
    • Barr, R. S., F. Glover, D. Klingman. 1981. A new optimization method for large scale fixed charge transportation problems. Oper. Res. 29(3) 448-463.
    • (1981) Oper. Res. , vol.29 , Issue.3 , pp. 448-463
    • Barr, R.S.1    Glover, F.2    Klingman, D.3
  • 6
    • 0033149023 scopus 로고    scopus 로고
    • Capacity improvement, penalties, and the fixed charge transportation problem
    • Bell, G. J., B. W. Lamar, C. A. Wallace. 1999. Capacity improvement, penalties, and the fixed charge transportation problem. Naval Res. Logist. 46(4) 341-355.
    • (1999) Naval Res. Logist. , vol.46 , Issue.4 , pp. 341-355
    • Bell, G.J.1    Lamar, B.W.2    Wallace, C.A.3
  • 7
    • 0015588241 scopus 로고
    • Network design with fixed and variable cost elements
    • Billheimer, J. W., P. Gray. 1973. Network design with fixed and variable cost elements. Transportation Sci. 7(1) 49-74.
    • (1973) Transportation Sci. , vol.7 , Issue.1 , pp. 49-74
    • Billheimer, J.W.1    Gray, P.2
  • 8
    • 0022751554 scopus 로고
    • Improved penalties for fixed cost linear programs using Lagrangean relaxation
    • Cabot, A. V., S. S. Erenguc. 1986. Improved penalties for fixed cost linear programs using Lagrangean relaxation. Management Sci. 32(7) 856-869.
    • (1986) Management Sci. , vol.32 , Issue.7 , pp. 856-869
    • Cabot, A.V.1    Erenguc, S.S.2
  • 9
    • 18744395787 scopus 로고    scopus 로고
    • Solving a time-space network formulation for the convoy movement problem
    • Chardaire, P., G. P. McKeown, S. A. Verity-Harrison, S. B. Richardson. 2005. Solving a time-space network formulation for the convoy movement problem. Oper. Res. 53(2) 219-230.
    • (2005) Oper. Res. , vol.53 , Issue.2 , pp. 219-230
    • Chardaire, P.1    McKeown, G.P.2    Verity-Harrison, S.A.3    Richardson, S.B.4
  • 10
    • 0038465739 scopus 로고
    • An approximate solution method for the fixed charge problem
    • Cooper, L., C. Drebes. 1967. An approximate solution method for the fixed charge problem. Naval Res. Logist. Quart. 14(1) 101-113.
    • (1967) Naval Res. Logist. Quart. , vol.14 , Issue.1 , pp. 101-113
    • Cooper, L.1    Drebes, C.2
  • 11
    • 9544219699 scopus 로고    scopus 로고
    • A survey on Benders decomposition applied to fixed-charge network design problems
    • Costa, A. M. 2005. A survey on Benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6) 1429-1450.
    • (2005) Comput. Oper. Res. , vol.32 , Issue.6 , pp. 1429-1450
    • Costa, A.M.1
  • 12
    • 0031635712 scopus 로고    scopus 로고
    • Solving to optimality the uncapacitated fixed-charge network flow problem
    • Cruz, F. R. B., J. MacGregor Smith, G. R. Mateus. 1998. Solving to optimality the uncapacitated fixed-charge network flow problem. Comput. Oper. Res. 25(1) 67-81.
    • (1998) Comput. Oper. Res. , vol.25 , Issue.1 , pp. 67-81
    • Cruz, F.R.B.1    MacGregor Smith, J.2    Mateus, G.R.3
  • 13
    • 0038803579 scopus 로고
    • An approximate algorithm for the fixed charge problem
    • Denzler, D. 1969. An approximate algorithm for the fixed charge problem. Naval Res. Logist. Quart. 16(1-4) 411-416.
    • (1969) Naval Res. Logist. Quart. , vol.16 , Issue.1-4 , pp. 411-416
    • Denzler, D.1
  • 14
    • 0009014792 scopus 로고
    • An algorithm for the solution of mixed integer programming problems
    • Driebeek, N. J. 1966. An algorithm for the solution of mixed integer programming problems. Management Sci. 12(7) 576-587.
    • (1966) Management Sci. , vol.12 , Issue.7 , pp. 576-587
    • Driebeek, N.J.1
  • 15
    • 77952021895 scopus 로고    scopus 로고
    • Solving the uncapacitated fixed-charge network flow with metaheuristics
    • J. P. de Sousa, ed, Porto, Portugal
    • Duhamel, C. 2001. Solving the uncapacitated fixed-charge network flow with metaheuristics. J. P. de Sousa, ed. Proc. 4th Metaheuristics Internat. Conf. (MIC 2001), Porto, Portugal, 685-689.
    • (2001) Proc. 4th Metaheuristics Internat. Conf. (MIC 2001) , pp. 685-689
    • Duhamel, C.1
  • 17
    • 0025388562 scopus 로고
    • Successive linear approximation procedure for stochastic, dynamic vehicle allocation problems
    • Frantzeskakis, L. F., W. B. Powell. 1990. Successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Sci. 24(1) 40-57.
    • (1990) Transportation Sci. , vol.24 , Issue.1 , pp. 40-57
    • Frantzeskakis, L.F.1    Powell, W.B.2
  • 18
    • 77952033054 scopus 로고    scopus 로고
    • Optimizing cash management for large scale bank operations
    • Department of Engineering Management, Information, and Systems, Southern Methodist University, Dallas
    • Frost, M., B. Jorgenson, J. Kennington, A. Madhavan. 2008. Optimizing cash management for large scale bank operations. Technical Report 08-EMIS-03, Department of Engineering Management, Information, and Systems, Southern Methodist University, Dallas.
    • (2008) Technical Report 08-EMIS-03
    • Frost, M.1    Jorgenson, B.2    Kennington, J.3    Madhavan, A.4
  • 20
    • 38549093383 scopus 로고    scopus 로고
    • Evolutionary network design: Hybrid genetic algorithms approach
    • Gen, M., R. Cheng. 2003. Evolutionary network design: Hybrid genetic algorithms approach. Internat. J. Computational Intelligence Appl. 3(4) 357-380.
    • (2003) Internat. J. Computational Intelligence Appl. , vol.3 , Issue.4 , pp. 357-380
    • Gen, M.1    Cheng, R.2
  • 21
    • 0035451950 scopus 로고    scopus 로고
    • Network design techniques using adapted genetic algorithms
    • Gen, M., R. Cheng, S. S. Oren. 2001. Network design techniques using adapted genetic algorithms. Adv. Engrg. Software 32(9) 731-744.
    • (2001) Adv. Engrg. Software , vol.32 , Issue.9 , pp. 731-744
    • Gen, M.1    Cheng, R.2    Oren, S.S.3
  • 22
    • 26044454367 scopus 로고    scopus 로고
    • Recent network design techniques using evolutionary algorithms
    • Gen, M., A. Kumar, J. R. Kim. 2005. Recent network design techniques using evolutionary algorithms. Internat. J. Production Econom. 98(2) 251-261.
    • (2005) Internat. J. Production Econom. , vol.98 , Issue.2 , pp. 251-261
    • Gen, M.1    Kumar, A.2    Kim, J.R.3
  • 23
    • 21644465612 scopus 로고    scopus 로고
    • Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
    • Gintner, V., N. Kliewer, L. Suhl. 2005. Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice. OR Spectrum 27(4) 507-523.
    • (2005) OR Spectrum , vol.27 , Issue.4 , pp. 507-523
    • Gintner, V.1    Kliewer, N.2    Suhl, L.3
  • 24
    • 0002703574 scopus 로고
    • Tabu search: A tutorial
    • Glover, F. 1990. Tabu search: A tutorial. Interfaces 20(4) 74-94.
    • (1990) Interfaces , vol.20 , Issue.4 , pp. 74-94
    • Glover, F.1
  • 26
    • 0007546535 scopus 로고
    • Technical note-Exact solution of the fixed-charge transportation problem
    • Gray, P. 1971. Technical note-Exact solution of the fixed-charge transportation problem. Oper. Res. 19(6) 1529-1583.
    • (1971) Oper. Res. , vol.19 , Issue.6 , pp. 1529-1583
    • Gray, P.1
  • 27
    • 31144472582 scopus 로고    scopus 로고
    • A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases
    • Guo, Y., T. Mellouli, L. Suhl, M. P. Thiel. 2006. A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases. Eur. J. Oper. Res. 171(3) 1169-1181.
    • (2006) Eur. J. Oper. Res. , vol.171 , Issue.3 , pp. 1169-1181
    • Guo, Y.1    Mellouli, T.2    Suhl, L.3    Thiel, M.P.4
  • 28
    • 0026169505 scopus 로고
    • Exact algorithm for solving a special fixed-charge linear programming problem
    • Haberl, J. 1991. Exact algorithm for solving a special fixed-charge linear programming problem. J. Optim. Theory Appl. 69(3) 489-529.
    • (1991) J. Optim. Theory Appl. , vol.69 , Issue.3 , pp. 489-529
    • Haberl, J.1
  • 29
    • 0030143384 scopus 로고    scopus 로고
    • Formulation and solution of a multicommodity, multi-modal network flow model for disaster relief operations
    • Haghani, A., S.-C. Oh. 1996. Formulation and solution of a multicommodity, multi-modal network flow model for disaster relief operations. Transportation Res. Part A: Policy Practice 30(3) 231-250.
    • (1996) Transportation Res. Part A: Policy Practice , vol.30 , Issue.3 , pp. 231-250
    • Haghani, A.1    Oh, S.-C.2
  • 30
    • 0030290035 scopus 로고    scopus 로고
    • Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation
    • Herer, Y. T., M. J. Rosenblatt, I. Hefter. 1996. Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation. Transportation Sci. 30(4) 276-290.
    • (1996) Transportation Sci. , vol.30 , Issue.4 , pp. 276-290
    • Herer, Y.T.1    Rosenblatt, M.J.2    Hefter, I.3
  • 33
    • 0036567990 scopus 로고    scopus 로고
    • On the use of genetic algorithms to solve location problems
    • Jaramillo, J. H., J. Bhadury, R. Batta. 2002. On the use of genetic algorithms to solve location problems. Comput. Oper. Res. 29(6) 761-779.
    • (2002) Comput. Oper. Res. , vol.29 , Issue.6 , pp. 761-779
    • Jaramillo, J.H.1    Bhadury, J.2    Batta, R.3
  • 34
    • 0027646865 scopus 로고
    • Decision support framework for airline flight cancellations and delays
    • Jarrah, A. I. Z., G. Yu, N. Krishnamurthy, A. Rakshit. 1993. Decision support framework for airline flight cancellations and delays. Transportation Sci. 27(3) 266-280.
    • (1993) Transportation Sci. , vol.27 , Issue.3 , pp. 266-280
    • Jarrah, A.I.Z.1    Yu, G.2    Krishnamurthy, N.3    Rakshit, A.4
  • 35
    • 34548274011 scopus 로고    scopus 로고
    • Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm
    • Jo, J.-B., Y. Li, M. Gen. 2007. Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput. Indust. Engrg. 53(2) 290-298.
    • (2007) Comput. Indust. Engrg. , vol.53 , Issue.2 , pp. 290-298
    • Jo, J.-B.1    Li, Y.2    Gen, M.3
  • 36
    • 0016962323 scopus 로고
    • The fixed-charge transportation problem: A computational study with a branch-and-bound code
    • Kennington, J. 1976. The fixed-charge transportation problem: A computational study with a branch-and-bound code. Amer. Institute Indust. Engrg. Trans. 8(2) 241-247.
    • (1976) Amer. Institute Indust. Engrg. Trans. , vol.8 , Issue.2 , pp. 241-247
    • Kennington, J.1
  • 37
    • 0016962801 scopus 로고
    • A new branch-and-bound algorithm for the fixed-charge transportation problem
    • Kennington, J., E. Unger. 1976. A new branch-and-bound algorithm for the fixed-charge transportation problem. Management Sci. 22(10) 1116-1126.
    • (1976) Management Sci. , vol.22 , Issue.10 , pp. 1116-1126
    • Kennington, J.1    Unger, E.2
  • 38
    • 0036439218 scopus 로고    scopus 로고
    • Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
    • Kim, H.-J., J. N. Hooker. 2002. Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. Ann. Oper. Res. 115(1-4) 95-124.
    • (2002) Ann. Oper. Res. , vol.115 , Issue.1-4 , pp. 95-124
    • Kim, H.-J.1    Hooker, J.N.2
  • 39
    • 0032640670 scopus 로고    scopus 로고
    • A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
    • Kim, D., P. M. Pardalos. 1999. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4) 195-203.
    • (1999) Oper. Res. Lett. , vol.24 , Issue.4 , pp. 195-203
    • Kim, D.1    Pardalos, P.M.2
  • 40
    • 33748925200 scopus 로고    scopus 로고
    • A time-space network based exact optimization model for multi-depot bus scheduling
    • Kliewer, N., T. Mellouli, L. Suhl. 2006. A time-space network based exact optimization model for multi-depot bus scheduling. Eur. J. Oper. Res. 175(3) 1616-1627.
    • (2006) Eur. J. Oper. Res. , vol.175 , Issue.3 , pp. 1616-1627
    • Kliewer, N.1    Mellouli, T.2    Suhl, L.3
  • 41
    • 0031247849 scopus 로고    scopus 로고
    • Revised-modified penalties for fixed charge transportation problems
    • Lamar, B. W., C. A. Wallace. 1997. Revised-modified penalties for fixed charge transportation problems. Management Sci. 43(10) 1431-1436.
    • (1997) Management Sci. , vol.43 , Issue.10 , pp. 1431-1436
    • Lamar, B.W.1    Wallace, C.A.2
  • 42
    • 33646549264 scopus 로고    scopus 로고
    • Airport management: Taxi planning
    • Marín, A. G. 2006. Airport management: Taxi planning. Ann. Oper. Res. 143(1) 191-202.
    • (2006) Ann. Oper. Res. , vol.143 , Issue.1 , pp. 191-202
    • Marín, A.G.1
  • 43
    • 35348829134 scopus 로고    scopus 로고
    • Network design: Taxi planning
    • Marín, A. G., E. Codina. 2008. Network design: Taxi planning. Ann. Oper. Res. 157(1) 135-151.
    • (2008) Ann. Oper. Res. , vol.157 , Issue.1 , pp. 135-151
    • Marín, A.G.1    Codina, E.2
  • 44
    • 0026226016 scopus 로고
    • Nonstandard genetic algorithm for the nonlinear transportation problem
    • Michalewicz, Z., G. A. Vignaux, M. Hobbs. 1991. Nonstandard genetic algorithm for the nonlinear transportation problem. ORSA J. Comput. 3(4) 307-316.
    • (1991) ORSA J. Comput. , vol.3 , Issue.4 , pp. 307-316
    • Michalewicz, Z.1    Vignaux, G.A.2    Hobbs, M.3
  • 45
    • 0000605715 scopus 로고
    • Solving the fixed charge problem by ranking the extreme points
    • Murty, K. G. 1968. Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16(2) 268-279.
    • (1968) Oper. Res. , vol.16 , Issue.2 , pp. 268-279
    • Murty, K.G.1
  • 46
    • 37649022205 scopus 로고    scopus 로고
    • Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
    • Nahapetyan, A., P. M. Pardalos. 2008. Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Computational Optim. Appl. 39(1) 37-50.
    • (2008) Computational Optim. Appl. , vol.39 , Issue.1 , pp. 37-50
    • Nahapetyan, A.1    Pardalos, P.M.2
  • 47
    • 2142793094 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the single commodity uncapacitated fixed-charge network flow problem
    • Ortega, F., L. A. Wolsey. 2003. A branch-and-cut algorithm for the single commodity uncapacitated fixed-charge network flow problem. Networks 41(3) 143-158.
    • (2003) Networks , vol.41 , Issue.3 , pp. 143-158
    • Ortega, F.1    Wolsey, L.A.2
  • 48
    • 0000087980 scopus 로고
    • A branch-and-bound method for the fixed charge transportation problem
    • Palekar, U. S., M. H. Karwan, S. Zionts. 1990. A branch-and-bound method for the fixed charge transportation problem. Management Sci. 36(9) 1092-1105.
    • (1990) Management Sci. , vol.36 , Issue.9 , pp. 1092-1105
    • Palekar, U.S.1    Karwan, M.H.2    Zionts, S.3
  • 49
    • 0022723355 scopus 로고
    • A stochastic model of the dynamic vehicle allocation problem
    • Powell, W. B. 1986. A stochastic model of the dynamic vehicle allocation problem. Transportation Sci. 20(2) 117-129.
    • (1986) Transportation Sci. , vol.20 , Issue.2 , pp. 117-129
    • Powell, W.B.1
  • 50
    • 34047217442 scopus 로고    scopus 로고
    • New genetic algorithm for the fixed charge transportation problem
    • Dalian, China. IEEE, Piscataway, NJ
    • Sheng, S., Z. Dachen. 2006. New genetic algorithm for the fixed charge transportation problem. Proc. World Congress Intelligent Control and Automation, Dalian, China, Vol.2. IEEE, Piscataway, NJ, 7039-7043.
    • (2006) Proc. World Congress Intelligent Control and Automation , vol.2 , pp. 7039-7043
    • Sheng, S.1    Dachen, Z.2
  • 51
    • 56349115812 scopus 로고    scopus 로고
    • Genetic algorithm for the transportation problem with discontinuous piecewise linear cost function
    • Sheng, S., Z. Dachen, X. Xiaofei. 2006. Genetic algorithm for the transportation problem with discontinuous piecewise linear cost function. Internat. J. Comput. Sci. Network Security 6(7A) 182-190.
    • (2006) Internat. J. Comput. Sci. Network Security , vol.6 , Issue.7 A , pp. 182-190
    • Sheng, S.1    Dachen, Z.2    Xiaofei, X.3
  • 52
    • 0031074486 scopus 로고    scopus 로고
    • Static and dynamic timespace strategic models and algorithms for multilevel rail-car fleet management. Management Sci. 43(2) 235-250. Steinberg, D. I. 1970. The fixed charge problem
    • Sherali, H. D., C. H. Tuncbilek. 1997. Static and dynamic timespace strategic models and algorithms for multilevel rail-car fleet management. Management Sci. 43(2) 235-250. Steinberg, D. I. 1970. The fixed charge problem. Naval Res. Logist. Quart. 17(2) 217-236.
    • (1997) Naval Res. Logist. Quart. , vol.17 , Issue.2 , pp. 217-236
    • Sherali, H.D.1    Tuncbilek, C.H.2
  • 53
    • 21144474484 scopus 로고
    • Tabu search applied to the general fixed charge problem
    • Sun, M., P. G. McKeown. 1993. Tabu search applied to the general fixed charge problem. Ann. Oper. Res. 41(1-4) 405-420.
    • (1993) Ann. Oper. Res. , vol.41 , Issue.1-4 , pp. 405-420
    • Sun, M.1    McKeown, P.G.2
  • 54
    • 0032046512 scopus 로고    scopus 로고
    • Tabu search heuristic procedure for the fixed charge transportation problem
    • Sun, M., J. E. Aronson, P. G. McKeown, D. Drinka. 1998. Tabu search heuristic procedure for the fixed charge transportation problem. Eur. J. Oper. Res. 106(2-3) 441-456.
    • (1998) Eur. J. Oper. Res. , vol.106 , Issue.2-3 , pp. 441-456
    • Sun, M.1    Aronson, J.E.2    McKeown, P.G.3    Drinka, D.4
  • 55
    • 0346780433 scopus 로고    scopus 로고
    • A bundle algorithm approach for the aircraft schedule recovery problem during hub closures
    • Thengvall, B. G., J. F. Bard, G. Yu. 2003. A bundle algorithm approach for the aircraft schedule recovery problem during hub closures. Transportation Sci. 37(4) 392-407.
    • (2003) Transportation Sci. , vol.37 , Issue.4 , pp. 392-407
    • Thengvall, B.G.1    Bard, J.F.2    Yu, G.3
  • 56
    • 33750524873 scopus 로고    scopus 로고
    • A proposal of a genetic algorithm for fixed-charge transportation problem and related numerical experiments
    • Tohyama, H., K. Ida, C. Teramatsu. 2006. A proposal of a genetic algorithm for fixed-charge transportation problem and related numerical experiments. J. Japan Indust. Management Assoc. 57(3) 222-230.
    • (2006) J. Japan Indust. Management Assoc. , vol.57 , Issue.3 , pp. 222-230
    • Tohyama, H.1    Ida, K.2    Teramatsu, C.3
  • 57
    • 0008970476 scopus 로고
    • An improved branch-and-bound method for integer programming
    • Tomlin, J. A. 1971. An improved branch-and-bound method for integer programming. Oper. Res. 19(4) 1070-1074.
    • (1971) Oper. Res. , vol.19 , Issue.4 , pp. 1070-1074
    • Tomlin, J.A.1
  • 58
    • 0016870648 scopus 로고
    • A heuristic adjacent extreme point algorithm for the fixed charge problem
    • Walker, W. E. 1976. A heuristic adjacent extreme point algorithm for the fixed charge problem. Management Sci. 22(5) 587-596.
    • (1976) Management Sci. , vol.22 , Issue.5 , pp. 587-596
    • Walker, W.E.1
  • 59
    • 16244368081 scopus 로고    scopus 로고
    • An integrated model and solution approach for fleet sizing with heterogeneous assets
    • Wu, P., J. C. Hartman, G. R. Wilson. 2005. An integrated model and solution approach for fleet sizing with heterogeneous assets. Transportation Sci. 39(1) 87-103.
    • (2005) Transportation Sci. , vol.39 , Issue.1 , pp. 87-103
    • Wu, P.1    Hartman, J.C.2    Wilson, G.R.3
  • 60
    • 0031070860 scopus 로고    scopus 로고
    • Airline scheduling for the temporary closure of airports
    • Yan, S., C.-G. Lin. 1997. Airline scheduling for the temporary closure of airports. Transportation Sci. 31(1) 72-82.
    • (1997) Transportation Sci. , vol.31 , Issue.1 , pp. 72-82
    • Yan, S.1    Lin, C.-G.2
  • 61
    • 33846798333 scopus 로고    scopus 로고
    • A time-space network model for work team scheduling after a major disaster
    • Yan, S., Y.-L. Shih. 2007. A time-space network model for work team scheduling after a major disaster. J. Chinese Institute Engineers 30(1) 63-75.
    • (2007) J. Chinese Institute Engineers , vol.30 , Issue.1 , pp. 63-75
    • Yan, S.1    Shih, Y.-L.2
  • 62
    • 34547829742 scopus 로고    scopus 로고
    • A bicriteria solid transportation problem with fixed charge under stochastic environment
    • Yang, L., Y. Feng. 2007. A bicriteria solid transportation problem with fixed charge under stochastic environment. Appl. Math. Modeling 31(12) 2668-2683.
    • (2007) Appl. Math. Modeling , vol.31 , Issue.12 , pp. 2668-2683
    • Yang, L.1    Feng, Y.2
  • 63
    • 0023396415 scopus 로고
    • Dynamic space-time network flow model for city traffic congestion
    • Zawack, D. J., G. L. Thompson. 1987. Dynamic space-time network flow model for city traffic congestion. Transportation Sci. 21(3) 153-162.
    • (1987) Transportation Sci. , vol.21 , Issue.3 , pp. 153-162
    • Zawack, D.J.1    Thompson, G.L.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.