-
1
-
-
18244385032
-
-
Technical Report Dept, of Comp. Sci. and Eng., Southern Methodist University, Dallas
-
J.L. Kennington, V.S.S. Nair and G. Spiride: "Optimal spare capacity assignment for path restorable mesh networks: cuts, decomposition, and an empirical analysis," Technical Report 98-CSE-11, Dept, of Comp. Sci. and Eng., Southern Methodist University, Dallas, 1998.
-
(1998)
Optimal Spare Capacity Assignment for Path Restorable Mesh Networks: Cuts, Decomposition, and An Empirical Analysis
-
-
Kennington, J.L.1
Nair, V.S.S.2
Spiride, G.3
-
2
-
-
0343601002
-
Economic allocation of spare capacity in mesh-restorable networks: Models and algorithms
-
March
-
F. Poppe and P. Demeester: "Economic allocation of spare capacity in mesh-restorable networks: models and algorithms," 6th Int. Conf. on Telecommunication Systems, Modeling and Analysis, Nashville, pp. 77-86, March 1998.
-
(1998)
6th Int. Conf. on Telecommunication Systems, Modeling and Analysis, Nashville
, pp. 77-86
-
-
Poppe, F.1
Demeester, P.2
-
5
-
-
0031352890
-
Restoration strategies and spare capacity requirements in self-healing ATM networks
-
Y. Xiong, L. Mason: "Restoration strategies and spare capacity requirements in self-healing ATM networks," IEEE Infocom '97, pp. 353-360, 1997.
-
(1997)
IEEE Infocom '97
, pp. 353-360
-
-
Xiong, Y.1
Mason, L.2
-
7
-
-
0032097259
-
Optimal capacity placement for path restoration in STM or ATM mesh survivable networks
-
R. Iraschko, M. MacGregor, W.D. Grover: "Optimal capacity placement for path restoration in STM or ATM mesh survivable networks," IEEE/ACM Transactions on Networking vol. 6, no. 3, pp. 325-336, 1998.
-
(1998)
IEEE/ACM Transactions on Networking
, vol.6
, Issue.3
, pp. 325-336
-
-
Iraschko, R.1
MacGregor, M.2
Grover, W.D.3
-
9
-
-
21344488548
-
A polyhedral approach to multicommodity survivable network design
-
ZIB-Report
-
G. Dahl and M. Stoer: "A polyhedral approach to multicommodity survivable network design," Numerische Mathematik 68(1) pp. 149-167, ZIB-Report SC-93-09, www.zib.de, 1993.
-
(1993)
Numerische Mathematik
, vol.68
, Issue.1
, pp. 149-167
-
-
Dahl, G.1
Stoer, M.2
-
11
-
-
77956963178
-
Optimum synthesis of a network with non-simultaneous MCF requirements
-
P. Hansen (ed.), North Holland Publishing Company
-
M. Minoux: "Optimum synthesis of a network with non-simultaneous MCF requirements," Studies on Graphs and Discrete Programming, P. Hansen (ed.), pp. 269-277. North Holland Publishing Company 1981.
-
(1981)
Studies on Graphs and Discrete Programming
, pp. 269-277
-
-
Minoux, M.1
-
13
-
-
9644308639
-
Partitioning procedures for solving mixed-variables programming problems
-
J. Benders: "Partitioning procedures for solving mixed-variables programming problems," Numerische Mathematik 4(1): pp. 238-252, 1962.
-
(1962)
Numerische Mathematik
, vol.4
, Issue.1
, pp. 238-252
-
-
Benders, J.1
-
14
-
-
0026124209
-
A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems
-
M. Padberg, G. Rinaldi: "A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems," SIAM Review no. 33, pp. 60-100, 1991.
-
(1991)
SIAM Review
, Issue.33
, pp. 60-100
-
-
Padberg, M.1
Rinaldi, G.2
-
15
-
-
0001615533
-
Valid inequalities for 0/1 knapsacks and MIPs with Generalised Upper Bound constraints
-
L.A. Wolsey: "Valid inequalities for 0/1 knapsacks and MIPs with Generalised Upper Bound constraints," Discrete Applied Mathematics no. 29, pp. 251-261, 1990.
-
(1990)
Discrete Applied Mathematics
, Issue.29
, pp. 251-261
-
-
Wolsey, L.A.1
-
17
-
-
0001745044
-
On an extension of the maximum-flow minimum-cut theorem to multicommodity flows
-
M. Iri: "On an extension of the maximum-flow minimum-cut theorem to multicommodity flows," Journal of the Operations Research Society of Japan, 13(3):129-135, 1971.
-
(1971)
Journal of the Operations Research Society of Japan
, vol.13
, Issue.3
, pp. 129-135
-
-
Iri, M.1
|