-
1
-
-
0003515463
-
-
Prentice Hall Englewood Cliffs
-
Ahuja, R. K.; Magnanti, T. L.; & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. Englewood Cliffs: Prentice Hall.
-
(1993)
Network Flows: Theory, Algorithms, and Applications
-
-
Ahuja, R.K.1
Magnanti, T.L.2
Orlin, J.B.3
-
2
-
-
0041722535
-
Cost-efficient network synthesis from leased lines
-
10.1023/A:1018984102311
-
D. Alevras M. Grötschel R. Wessäly 1998 Cost-efficient network synthesis from leased lines Annals of Operations Research 76 1 20 10.1023/A:1018984102311
-
(1998)
Annals of Operations Research
, vol.76
, pp. 1-20
-
-
Alevras, D.1
Grötschel, M.2
Wessäly, R.3
-
3
-
-
35048850859
-
Metric inequalities and the network loading problem
-
In D. Bienstock & G. Nemhauser (Eds.) New York, June 7-11, 2004
-
Avella, P.; Mattia, S. & Sassano, A. (2004). Metric inequalities and the network loading problem. In D. Bienstock & G. Nemhauser (Eds.), Proceedings of the 10th international IPCO conference, New York, June 7-11, 2004 (pp. 16-32).
-
(2004)
Proceedings of the 10th International IPCO Conference
, pp. 16-32
-
-
Avella, P.1
Mattia, S.2
Sassano, A.3
-
4
-
-
34249766680
-
A column generation and partitioning approach for multi-commodity flow problems
-
10.1007/BF02110307
-
C. Barnhart C. A. Hane E. L. Johnson G. Sigismondi 1995 A column generation and partitioning approach for multi-commodity flow problems Telecommunication Systems 3 239 258 10.1007/BF02110307
-
(1995)
Telecommunication Systems
, vol.3
, pp. 239-258
-
-
Barnhart, C.1
Hane, C.A.2
Johnson, E.L.3
Sigismondi, G.4
-
5
-
-
9644308639
-
Partitioning procedures for solving mixed integer variables programming problems
-
10.1007/BF01386316
-
J. F. Benders 1962 Partitioning procedures for solving mixed integer variables programming problems Numerische Mathematic 4 238 252 10.1007/BF01386316
-
(1962)
Numerische Mathematic
, vol.4
, pp. 238-252
-
-
Benders, J.F.1
-
6
-
-
0043222683
-
Strong inequalities for capacitated survivable network design problems
-
10.1007/PL00011390
-
D. Bienstock G. Muratore 2000 Strong inequalities for capacitated survivable network design problems Mathematical Programming 89 1 127 147 10.1007/PL00011390
-
(2000)
Mathematical Programming
, vol.89
, Issue.1
, pp. 127-147
-
-
Bienstock, D.1
Muratore, G.2
-
8
-
-
0010713233
-
A polyhedral approach to an integer multicommodity flow problem
-
10.1016/S0166-218X(99)00187-0
-
L. Brunetta M. Conforti M. Fischetti 2000 A polyhedral approach to an integer multicommodity flow problem Discrete Applied Mathematics 101 13 36 10.1016/S0166-218X(99)00187-0
-
(2000)
Discrete Applied Mathematics
, vol.101
, pp. 13-36
-
-
Brunetta, L.1
Conforti, M.2
Fischetti, M.3
-
9
-
-
9544219699
-
A survey on Benders decomposition applied to fixed-charge network design problems
-
10.1016/j.cor.2003.11.012
-
A. M. Costa 2005 A survey on Benders decomposition applied to fixed-charge network design problems Computers & Operations Research 32 1429 1450 10.1016/j.cor.2003.11.012
-
(2005)
Computers & Operations Research
, vol.32
, pp. 1429-1450
-
-
Costa, A.M.1
-
10
-
-
0035885267
-
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
-
DOI 10.1016/S0166-218X(00)00310-3, PII S0166218X00003103
-
T. G. Crainic A. Frangionni B. Gendron 2001 Bundle-based relaxation methods for multicommodity capacitated fixed-charge Network design problems Discrete Applied Mathematics 112 73 99 10.1016/S0166-218X(00)00310-3 (Pubitemid 33676135)
-
(2001)
Discrete Applied Mathematics
, vol.112
, Issue.1-3
, pp. 73-99
-
-
Crainic, T.G.1
Frangioni, A.2
Gendron, B.3
-
11
-
-
0001068281
-
A cutting plane algorithm for multicommodity survivable network design problems
-
10.1287/ijoc.10.1.1
-
G. Dahl M. Stoer 1998 A cutting plane algorithm for multicommodity survivable network design problems INFORMS Journal on Computing 10 1 1 11 10.1287/ijoc.10.1.1
-
(1998)
INFORMS Journal on Computing
, vol.10
, Issue.1
, pp. 1-11
-
-
Dahl, G.1
Stoer, M.2
-
12
-
-
0015973449
-
Multicommodity distribution system design by Benders decomposition
-
10.1287/mnsc.20.5.822
-
A. M. Geoffrion G. W. Graves 1974 Multicommodity distribution system design by Benders decomposition Management Science 20 822 844 10.1287/mnsc.20.5.822
-
(1974)
Management Science
, vol.20
, pp. 822-844
-
-
Geoffrion, A.M.1
Graves, G.W.2
-
13
-
-
0028484723
-
On using approximations of the Benders master problem
-
10.1016/0377-2217(94)90032-9
-
K. Holmberg 1994 On using approximations of the Benders master problem European Journal of Operational Research 77 111 125 10.1016/0377-2217(94)90032-9
-
(1994)
European Journal of Operational Research
, vol.77
, pp. 111-125
-
-
Holmberg, K.1
-
14
-
-
0034179697
-
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
-
10.1287/opre.48.3.461.12439
-
K. Holmberg D. Yuan 2000 A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem Operations Research 48 3 461 481 10.1287/opre.48.3.461.12439
-
(2000)
Operations Research
, vol.48
, Issue.3
, pp. 461-481
-
-
Holmberg, K.1
Yuan, D.2
-
15
-
-
0942281491
-
A multicommodity network-flow problem with side constraints on paths solved by column generation
-
DOI 10.1287/ijoc.15.1.42.15151
-
K. Holmberg D. Yuan 2003 A multicommodity network flow problem with side constraints on paths solved by column generation INFORMS Journal on Computing 15 1 42 57 10.1287/ijoc.15.1.42.15151 (Pubitemid 39042732)
-
(2003)
INFORMS Journal on Computing
, vol.15
, Issue.1
, pp. 42-57
-
-
Holmberg, K.1
Yuan, D.2
-
17
-
-
23044524075
-
Model and heuristic for a generalized access network design problem
-
DOI 10.1023/A:1019147029476
-
G. R. Mateus R. V. L. Franqueira 2000 Model and heuristic for a generalized access network design problem Telecommunication Systems 15 257 271 10.1023/A:1019147029476 (Pubitemid 33220155)
-
(2000)
Telecommunication Systems
, vol.15
, Issue.3-4
, pp. 257-272
-
-
Mateus, G.R.1
Franqueira, R.V.L.2
-
18
-
-
0000715666
-
A modified Benders partitioning algorithm for mixed integer programming
-
10.1287/mnsc.24.3.312
-
D. McDaniel M. Devine 1977 A modified Benders partitioning algorithm for mixed integer programming Management Science 24 312 379 10.1287/mnsc.24.3.312
-
(1977)
Management Science
, vol.24
, pp. 312-379
-
-
McDaniel, D.1
Devine, M.2
|