메뉴 건너뛰기




Volumn 219, Issue 3, 2012, Pages 738-750

Multi-period traffic routing in satellite networks

Author keywords

Branch and price and cut; Integer programming; Large scale optimization; OR in telecommunications; Routing

Indexed keywords

BRANCH-AND-PRICE-AND-CUT; COMPUTATIONAL WORK; GEOSYNCHRONOUS SATELLITES; LARGE-SCALE OPTIMIZATION; MULTI-PERIOD; MULTIPLE-TIME PERIODS; NETWORK PLANNERS; NETWORK SIZE; OPTIMIZATION PROCEDURES; OR IN TELECOMMUNICATIONS; PLANNING HORIZONS; PRICING PROBLEMS; ROUTE CHANGES; ROUTING; ROUTING DECISIONS; SATELLITE NETWORK; SATELLITE PROVIDERS; TRAFFIC ROUTING;

EID: 84857921947     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.11.004     Document Type: Article
Times cited : (17)

References (26)
  • 2
    • 84857911136 scopus 로고    scopus 로고
    • Solving multicommodity flow problems with branch-and-price
    • F. Alvelos, and J.M. Valério de Carvalho Solving multicommodity flow problems with branch-and-price Investigaão Operational 21 1 2001 71 92
    • (2001) Investigaão Operational , vol.21 , Issue.1 , pp. 71-92
    • Alvelos, F.1    Valério De Carvalho, J.M.2
  • 3
    • 0034296173 scopus 로고    scopus 로고
    • Wavelength-routed optical networks: Linear formulation, resource budgeting tradeoffs, and a reconfiguration study
    • DOI 10.1109/90.879346
    • D. Banerjee, and B. Mukherjee Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study IEEE/ACM Transactions on Networking 8 5 2000 598 607 (Pubitemid 32017924)
    • (2000) IEEE/ACM Transactions on Networking , vol.8 , Issue.5 , pp. 598-607
    • Banerjee, D.1    Mukherjee, B.2
  • 4
    • 0034156185 scopus 로고    scopus 로고
    • Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems
    • C. Barnhart, C.A. Hane, and P.H. Vance Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems Operations Research 48 2 2000 318 326
    • (2000) Operations Research , vol.48 , Issue.2 , pp. 318-326
    • Barnhart, C.1    Hane, C.A.2    Vance, P.H.3
  • 6
    • 0001237931 scopus 로고    scopus 로고
    • Capacitated network design - Polyhedral structure and computation
    • D. Bienstock, and O. Günlük Capacitated network design - polyhedral structure and computation INFORMS Journal on Computing 8 3 1996 243 259 (Pubitemid 126681515)
    • (1996) INFORMS Journal on Computing , vol.8 , Issue.3 , pp. 243-259
    • Bienstock, D.1    Gunluk, O.2
  • 7
    • 70449690198 scopus 로고    scopus 로고
    • Branch-and-price-heuristics: A case study on the vehicle routing problem with time windows
    • G. Desaulniers, J. Desrosiers, M.M. Solomon, Springer
    • E. Danna, and C. Pape Branch-and-price-heuristics: a case study on the vehicle routing problem with time windows G. Desaulniers, J. Desrosiers, M.M. Solomon, Column Generation 2005 Springer 99 129
    • (2005) Column Generation , pp. 99-129
    • Danna, E.1    Pape, C.2
  • 10
    • 0345918756 scopus 로고    scopus 로고
    • The Network Redesign Problem for Access Telecommunications Networks
    • L.F. Frantzeskakis, and H. Luss The network redesign problem for access telecommunications networks Naval Research Logistics 46 5 1999 487 506 (Pubitemid 129584917)
    • (1999) Naval Research Logistics , vol.46 , Issue.5 , pp. 487-506
    • Frantzeskakis, L.F.1    Luss, H.2
  • 13
    • 0000660003 scopus 로고    scopus 로고
    • Lifted cover inequalities for 0-1 integer programs: Computation
    • Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh Lifted cover inequalities for 0-1 integer programs: computation INFORMS Journal on Computing 10 4 1998 427 437 (Pubitemid 128669148)
    • (1998) INFORMS Journal on Computing , vol.10 , Issue.4 , pp. 427-437
    • Gu, Z.1    Nemhauser, G.L.2    Savelsbergh, M.W.P.3
  • 15
    • 0001774148 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for capacitated network design
    • O. Günlük A branch-and-cut algorithm for capacitated network design Mathematical Programming 86 1 1999 17 39
    • (1999) Mathematical Programming , vol.86 , Issue.1 , pp. 17-39
    • Günlük, O.1
  • 16
    • 0942281491 scopus 로고    scopus 로고
    • A multicommodity network-flow problem with side constraints on paths solved by column generation
    • DOI 10.1287/ijoc.15.1.42.15151
    • K. Holmberg, and D. Yuan A multicommodity network-flow problem with side constraints on paths solved by column generation INFORMS Journal on Computing 15 1 2003 42 57 (Pubitemid 39042732)
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.1 , pp. 42-57
    • Holmberg, K.1    Yuan, D.2
  • 17
    • 0000213671 scopus 로고    scopus 로고
    • Traffic optimization and reconfiguration management of multiwavelength multihop broadcast ligthwave networks
    • J.-F.P. Labourdette Traffic optimization and reconfiguration management of multiwavelength multihop broadcast ligthwave networks Computer Networks and ISDN Systems 30 9-10 1998 981 998
    • (1998) Computer Networks and ISDN Systems , vol.30 , Issue.910 , pp. 981-998
    • Labourdette, J.-F.P.1
  • 19
    • 34547765532 scopus 로고    scopus 로고
    • Multperiod network design with incremental routing
    • B. Lardeux, D. Nace, and J. Geffard Multperiod network design with incremental routing Networks 50 1 2007 109 116
    • (2007) Networks , vol.50 , Issue.1 , pp. 109-116
    • Lardeux, B.1    Nace, D.2    Geffard, J.3
  • 21
    • 23044519733 scopus 로고    scopus 로고
    • Some approaches to solving a multihour broadband network capacity design problem with single-path routing
    • D. Medhi, and D. Tipper Some approaches to solving a multihour broadband network capacity design problem with single-path routing Telecommunication Systems 13 2-4 2000 269 291
    • (2000) Telecommunication Systems , vol.13 , Issue.24 , pp. 269-291
    • Medhi, D.1    Tipper, D.2
  • 22
    • 0031272503 scopus 로고    scopus 로고
    • A branch-and-price algorithm for the generalized assignment problem
    • M.W.P. Savelsbergh A branch-and-price algorithm for the generalized assignment problem Operations Research 45 6 1997 831 841
    • (1997) Operations Research , vol.45 , Issue.6 , pp. 831-841
    • Savelsbergh, M.W.P.1
  • 23
    • 78649919759 scopus 로고    scopus 로고
    • SIA Tech. Rep.; Satellite Industry Association
    • SIA, 2010. State of the satellite industry report. Tech. Rep.; Satellite Industry Association. .
    • (2010) State of the Satellite Industry Report
  • 24
    • 0031096922 scopus 로고    scopus 로고
    • Airline crew scheduling: A new formulation and decomposition algorithm
    • P.H. Vance, C. Barnhart, E. Johnson, and G. Nemhauser Airline crew scheduling: a new formulation and decomposition algorithm Operations Research 45 2 1997 188 200 (Pubitemid 127684698)
    • (1997) Operations Research , vol.45 , Issue.2 , pp. 188-200
    • Vance, P.H.1    Barnhart, C.2    Johnson, E.L.3    Nemhauser, G.L.4
  • 25
    • 0033725783 scopus 로고    scopus 로고
    • On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
    • F. Vanderbeck On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm Operations Research 48 1 2000 111 128
    • (2000) Operations Research , vol.48 , Issue.1 , pp. 111-128
    • Vanderbeck, F.1
  • 26
    • 0030264417 scopus 로고    scopus 로고
    • An exact algorithm for IP column generation
    • DOI 10.1016/0167-6377(96)00033-8, PII S0167637796000338
    • F. Vanderbeck, and L.A. Wolsey An exact algorithm for IP column generation Operations Research Letters 19 4 1996 151 159 (Pubitemid 126394962)
    • (1996) Operations Research Letters , vol.19 , Issue.4 , pp. 151-159
    • Vanderbeck, F.1    Wolsey, L.A.2


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