-
1
-
-
0043130524
-
Optimal expansion of capacitated transshipment networks
-
[1] R.K. Ahuja, J.L. Batra, S.K. Gupta, and A.P. Punnen, Optimal expansion of capacitated transshipment networks, Eur J Oper Res 89 (1996), 176-184.
-
(1996)
Eur J Oper Res
, vol.89
, pp. 176-184
-
-
Ahuja, R.K.1
Batra, J.L.2
Gupta, S.K.3
Punnen, A.P.4
-
2
-
-
34249928131
-
Models for planning capacity expansion in local access telecommunication networks
-
[2] A. Balakrishnan, T.L. Magnanti, A. Shulman, and R.T. Wong, Models for planning capacity expansion in local access telecommunication networks, Ann Oper Res 33 (1991), 239-284.
-
(1991)
Ann Oper Res
, vol.33
, pp. 239-284
-
-
Balakrishnan, A.1
Magnanti, T.L.2
Shulman, A.3
Wong, R.T.4
-
3
-
-
0002904552
-
A decomposition algorithm for local access telecommunications network expansion planning
-
[3] A. Balakrishnan, T.L. Magnanti, and R.T. Wong, A decomposition algorithm for local access telecommunications network expansion planning, Oper Res 43 (1995), 58-76.
-
(1995)
Oper Res
, vol.43
, pp. 58-76
-
-
Balakrishnan, A.1
Magnanti, T.L.2
Wong, R.T.3
-
4
-
-
84987028582
-
The prize collecting traveling salesman problem
-
[4] E. Balas, The prize collecting traveling salesman problem, Networks 19 (1989), 621-636.
-
(1989)
Networks
, vol.19
, pp. 621-636
-
-
Balas, E.1
-
5
-
-
85005980724
-
The prize collecting traveling salesman problem: II. Polyhedral results
-
[5] E. Balas, The prize collecting traveling salesman problem: II. Polyhedral results, Networks 25 (1995), 199-216.
-
(1995)
Networks
, vol.25
, pp. 199-216
-
-
Balas, E.1
-
6
-
-
0002630141
-
Computational experiences with an effective heuristic for some capacity expansion problems in local access networks
-
[6] D. Bienstock, Computational experiences with an effective heuristic for some capacity expansion problems in local access networks, Telecommun Syst 1 (1993), 379-400.
-
(1993)
Telecommun Syst
, vol.1
, pp. 379-400
-
-
Bienstock, D.1
-
7
-
-
0032256118
-
Expansion of multiple ring MANs
-
[7] S. Chamberland and B. Sansò, Expansion of multiple ring MANs, IEEE GLOBECOM'98 (1998), 2501-2507.
-
(1998)
IEEE GLOBECOM'98
, pp. 2501-2507
-
-
Chamberland, S.1
Sansò, B.2
-
8
-
-
85037804252
-
Topological design of a two-level network with modular switches
-
to appear
-
[8] S. Chamberland, B. Sansò, and O. Marcotte, Topological design of a two-level network with modular switches, Oper Res, to appear.
-
Oper Res
-
-
Chamberland, S.1
Sansò, B.2
Marcotte, O.3
-
9
-
-
0002402689
-
Telecommunications network topological design and capacity expansion: Formulation and algorithms
-
[9] S.G. Chang and B. Gavish, Telecommunications network topological design and capacity expansion: Formulation and algorithms, Telecommun Syst 1 (1993), 379-400.
-
(1993)
Telecommun Syst
, vol.1
, pp. 379-400
-
-
Chang, S.G.1
Gavish, B.2
-
10
-
-
0002590353
-
Lower bounding procedures for multiperiod telecommunications network expansion problems
-
[10] S.G. Chang and B. Gavish, Lower bounding procedures for multiperiod telecommunications network expansion problems, Oper Res 43 (1995), 43-57.
-
(1995)
Oper Res
, vol.43
, pp. 43-57
-
-
Chang, S.G.1
Gavish, B.2
-
11
-
-
21144463851
-
Optimal expansion of fiber-optic telecommunications networks in metropolitan area
-
[11] L.A. Cox, W.E. Kuehner, S.H. Parrish, and Y. Qiu, Optimal expansion of fiber-optic telecommunications networks in metropolitan area, Interfaces 23(2) (1993), 35-48.
-
(1993)
Interfaces
, vol.23
, Issue.2
, pp. 35-48
-
-
Cox, L.A.1
Kuehner, W.E.2
Parrish, S.H.3
Qiu, Y.4
-
13
-
-
85037799862
-
-
Research memorandum, University of Limburg (Maastricht)
-
[13] O.E. Flippo, A.W.J. Kolen, A.M.C.A. Koster, and R.L.M.J. van de Leensel, A dynamic programming algorithm for the local access network expansion problem. Research memorandum, University of Limburg (Maastricht), 1996, p. 27.
-
(1996)
A Dynamic Programming Algorithm for the Local Access Network Expansion Problem
, pp. 27
-
-
Flippo, O.E.1
Kolen, A.W.J.2
Koster, A.M.C.A.3
Van De Leensel, R.L.M.J.4
-
15
-
-
0000866856
-
New insertion and post optimization procedures for the traveling salesman problem
-
[15] M. Gendreau, A. Hertz, and G. Laporte, New insertion and post optimization procedures for the traveling salesman problem, Oper Res 40 (1992), 1086-1094.
-
(1992)
Oper Res
, vol.40
, pp. 1086-1094
-
-
Gendreau, M.1
Hertz, A.2
Laporte, G.3
-
17
-
-
0023173192
-
A shortest augmenting path algorithm for dense and sparse linear assignment problems
-
[17] R. Jonker and T. Volgenant, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Computing 38 (1987), 325-340.
-
(1987)
Computing
, vol.38
, pp. 325-340
-
-
Jonker, R.1
Volgenant, T.2
-
18
-
-
0026224123
-
An empirical analysis of the dense assignment problem: Sequential and parallel implementations
-
[18] J. Kennington and Z. Wang, An empirical analysis of the dense assignment problem: Sequential and parallel implementations, ORSA J Comput 4 (1991), 299-306.
-
(1991)
ORSA J Comput
, vol.4
, pp. 299-306
-
-
Kennington, J.1
Wang, Z.2
-
19
-
-
0028429445
-
Topological expansion of metropolitan area network
-
[19] L.J. Leblanc and S. Narasimhan, Topological expansion of metropolitan area network, Comput Networks ISDN Syst 26 (1994), 1235-1248.
-
(1994)
Comput Networks ISDN Syst
, vol.26
, pp. 1235-1248
-
-
Leblanc, L.J.1
Narasimhan, S.2
-
20
-
-
0020183161
-
Operations research and capacity expansion problems: A survey
-
[20] H. Luss, Operations research and capacity expansion problems: A survey, Oper Res 30 (1982), 907-947.
-
(1982)
Oper Res
, vol.30
, pp. 907-947
-
-
Luss, H.1
-
21
-
-
0000194794
-
Planning for optimal expansion of leased line communications networks
-
[21] S.H. Parrish, L.A. Cox, W.E. Kuehner, and Y. Qiu, Planning for optimal expansion of leased line communications networks, Ann Oper Res 36 (1992), 347-364.
-
(1992)
Ann Oper Res
, vol.36
, pp. 347-364
-
-
Parrish, S.H.1
Cox, L.A.2
Kuehner, W.E.3
Qiu, Y.4
-
22
-
-
0025536528
-
An algorithm for capacity expansion of local access networks
-
[22] A. Shulman and R. Vachani, An algorithm for capacity expansion of local access networks, IEEE INFOCOM (1990). 221-229.
-
(1990)
IEEE INFOCOM
, pp. 221-229
-
-
Shulman, A.1
Vachani, R.2
-
23
-
-
0003362313
-
Fiber network service survivability
-
[23] T.H. Wu, Fiber network service survivability, Artech House, 1992.
-
(1992)
Artech House
-
-
Wu, T.H.1
-
24
-
-
0029518887
-
Designing an ATM-based broadband network: An overview
-
[24] J. Yan and M. Beshai, Designing an ATM-based broadband network: An overview, IEEE GLOBECOM '95 (1995), 245-251.
-
(1995)
IEEE GLOBECOM '95
, pp. 245-251
-
-
Yan, J.1
Beshai, M.2
|