Model Persoalan Lokasi dengan Permintaan Acak Dalam Lingkungan Kompetitif
DAFTAR PUSTAKA
Avella.P, Sasano,A (2001) On the p-Median Polytope. Mathematical programming 89
,395-411.
Beasley JE. (1990) :OR-Library: distributing test problems by electronic mail. Journal of the perasional Research Society,41, 1069 1072.
Campbell, J.F.,Ernst, A.T., dan Krishnamoorthy, M. (2002): Hub Location Problems.
In Facility location : Applications and Theory, Z.Drezner and H.W.Hamacher
(Eds.),Springer .
Carello G, Della Croce F, Ghirardi M., dan Tadei R, (2003), Local search based metaheuristics for the hub location problem in two level telecommunication jaringans,
Internal Report,, Dipartemeno di Automatica ed Informatica, Politecnico di
Torino.
Carello G, Della Croce F, M. Ghirardi, R. Tadei, (2003) , Solving the hub Location
problem in telecommunication di Automatica ed Informatica, Politecnico di
Torino.
Chamberland, S. Sanso, B., Marcotte, O., Topological design of two-level telecomunication networks with modular switches, Operation Researc, 48, 745-60.
Costa A. (2005), A survey on benders decomposition applied to fixed-charge jaringan
design problems. Coputers and Operations Research ; 32(3.6): 144.21-50.
Crainic T, Frangioni A, Gendron B, (2001). Bundle beased relaxation methods
for multicommodity capaciated fixed charge jaringan design. Discrete Applied
Mathematics ;112(1-3):73-99.
Ernst A.T Krishnamoorthy,M. (1998) Exact and heuristic algorithms for the Unicapaciatated multiple allocation p-hub median problem, European Journal of
Operasional Research, 104, 100-112.
Feresmans C, Labble M, Laporte G. (2003) Generalized network design problems.
European Journal of Operational Research ; 148(1): -13.
Gourdin E, Labbe M, Yaman H, A branch and cut algorithm for hub location problems with single assignment, preprint, Univeersite Libre de Bruxelles, 2003,
available at http://smg.ulb.ac.be/.
Klincewicz J.G, (1998), hub location in backbone tributary jaringan design : a revew,
Location Science, 6 , 307-335.
Mihiro S., Masao F. (2001) Stackelberg hub location problem, Journal of the Operation Research Society Japan, 44, 390-404.
Monticone L. C. And Funk, G.,(1994), Application of the facility location problem
to the problem of lokating concentrators on an FAA microwave system, Annals
ofoperations research, 50: 437-454.
OKelly.M, D Skorin-Kapov, J. Skorin Kapov,(1996) Tight linear programming relaxations of ancapacitated p-hub median problems, Eurpean Journal of Operational Research, 94, 582-593.
32
Universitas Sumatera Utara
33
Thomadsen T, Stidsen T. (2007) The generalized fixed-charge network design problem. Computers and Operationn Research.,34, 997 1007.
Tommy T, Jesper Larsen, (2005) A hub location problem with fully interconnected
backbone and access networks Computers and Operations Research.
Yaman, H. (2002) : Concentratr locarion in Telecommunication Networks, Ph.D.
Thesis, Universite Libre de Bruxelles. Available at http://smg.ulb.ac.be/
Universitas Sumatera Utara
Avella.P, Sasano,A (2001) On the p-Median Polytope. Mathematical programming 89
,395-411.
Beasley JE. (1990) :OR-Library: distributing test problems by electronic mail. Journal of the perasional Research Society,41, 1069 1072.
Campbell, J.F.,Ernst, A.T., dan Krishnamoorthy, M. (2002): Hub Location Problems.
In Facility location : Applications and Theory, Z.Drezner and H.W.Hamacher
(Eds.),Springer .
Carello G, Della Croce F, Ghirardi M., dan Tadei R, (2003), Local search based metaheuristics for the hub location problem in two level telecommunication jaringans,
Internal Report,, Dipartemeno di Automatica ed Informatica, Politecnico di
Torino.
Carello G, Della Croce F, M. Ghirardi, R. Tadei, (2003) , Solving the hub Location
problem in telecommunication di Automatica ed Informatica, Politecnico di
Torino.
Chamberland, S. Sanso, B., Marcotte, O., Topological design of two-level telecomunication networks with modular switches, Operation Researc, 48, 745-60.
Costa A. (2005), A survey on benders decomposition applied to fixed-charge jaringan
design problems. Coputers and Operations Research ; 32(3.6): 144.21-50.
Crainic T, Frangioni A, Gendron B, (2001). Bundle beased relaxation methods
for multicommodity capaciated fixed charge jaringan design. Discrete Applied
Mathematics ;112(1-3):73-99.
Ernst A.T Krishnamoorthy,M. (1998) Exact and heuristic algorithms for the Unicapaciatated multiple allocation p-hub median problem, European Journal of
Operasional Research, 104, 100-112.
Feresmans C, Labble M, Laporte G. (2003) Generalized network design problems.
European Journal of Operational Research ; 148(1): -13.
Gourdin E, Labbe M, Yaman H, A branch and cut algorithm for hub location problems with single assignment, preprint, Univeersite Libre de Bruxelles, 2003,
available at http://smg.ulb.ac.be/.
Klincewicz J.G, (1998), hub location in backbone tributary jaringan design : a revew,
Location Science, 6 , 307-335.
Mihiro S., Masao F. (2001) Stackelberg hub location problem, Journal of the Operation Research Society Japan, 44, 390-404.
Monticone L. C. And Funk, G.,(1994), Application of the facility location problem
to the problem of lokating concentrators on an FAA microwave system, Annals
ofoperations research, 50: 437-454.
OKelly.M, D Skorin-Kapov, J. Skorin Kapov,(1996) Tight linear programming relaxations of ancapacitated p-hub median problems, Eurpean Journal of Operational Research, 94, 582-593.
32
Universitas Sumatera Utara
33
Thomadsen T, Stidsen T. (2007) The generalized fixed-charge network design problem. Computers and Operationn Research.,34, 997 1007.
Tommy T, Jesper Larsen, (2005) A hub location problem with fully interconnected
backbone and access networks Computers and Operations Research.
Yaman, H. (2002) : Concentratr locarion in Telecommunication Networks, Ph.D.
Thesis, Universite Libre de Bruxelles. Available at http://smg.ulb.ac.be/
Universitas Sumatera Utara