메뉴 건너뛰기




Volumn 86, Issue 1, 1999, Pages 17-39

A branch-and-cut algorithm for capacitated network design problems

Author keywords

Branch and cut; Computing; Mixed integer programming

Indexed keywords


EID: 0001774148     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050077     Document Type: Article
Times cited : (97)

References (29)
  • 2
    • 0030303863 scopus 로고    scopus 로고
    • Network design using cut inequalities
    • Barahona, F. (1996): Network design using cut inequalities. SIAM J. Optim. 6, 823-837
    • (1996) SIAM J. Optim. , vol.6 , pp. 823-837
    • Barahona, F.1
  • 4
    • 28944438468 scopus 로고    scopus 로고
    • Private communication
    • Bienstock, D. (1996): Private communication
    • (1996)
    • Bienstock, D.1
  • 5
    • 0001022584 scopus 로고    scopus 로고
    • Minimum cost capacity installation for multicommodity network flows
    • Bienstock, D., Chopra, S., Günlük, O., Tsai, C.-Y. (1998): Minimum cost capacity installation for multicommodity network flows. Math. Program. 81, 177-199
    • (1998) Math. Program. , vol.81 , pp. 177-199
    • Bienstock, D.1    Chopra, S.2    Günlük, O.3    Tsai, C.-Y.4
  • 6
    • 0001237931 scopus 로고    scopus 로고
    • Capacitated network design - Polyhedral structure and computation
    • Bienstock, D., Günlük, O. (1996): Capacitated network design - Polyhedral structure and computation. INFORMS J. Comput. 8, 243-259
    • (1996) INFORMS J. Comput. , vol.8 , pp. 243-259
    • Bienstock, D.1    Günlük, O.2
  • 7
    • 0000967199 scopus 로고
    • Computational experience with a difficult multicommodity flow problem
    • Bienstock, D., Günlük, O. (1995): Computational experience with a difficult multicommodity flow problem. Math. Program. 68, 213-238
    • (1995) Math. Program. , vol.68 , pp. 213-238
    • Bienstock, D.1    Günlük, O.2
  • 8
    • 0022093904 scopus 로고
    • Optimal attack and reinforcement of a network
    • Cunningham, W. (1985): Optimal attack and reinforcement of a network. J. ACM 32, 549-561
    • (1985) J. ACM , vol.32 , pp. 549-561
    • Cunningham, W.1
  • 10
    • 21344488548 scopus 로고
    • A polyhedral approach to multicommodity survivable network design
    • Dahl, G., Stoer, M. (1994): A polyhedral approach to multicommodity survivable network design. Numer. Math. 68, 149-167
    • (1994) Numer. Math. , vol.68 , pp. 149-167
    • Dahl, G.1    Stoer, M.2
  • 11
    • 0009014792 scopus 로고
    • An algorithm for the solution of mixed integer programming problems
    • Dribeek, N. (1966): An algorithm for the solution of mixed integer programming problems. Manage. Sci. 12, 576-587
    • (1966) Manage. Sci. , vol.12 , pp. 576-587
    • Dribeek, N.1
  • 16
    • 0001745044 scopus 로고
    • On an extension of the max-flow min-cut theorem to multicommodity flows
    • Iri, M. (1971): On an extension of the max-flow min-cut theorem to multicommodity flows. J. Oper. Res. Soc. Jpn. 13, 129-135
    • (1971) J. Oper. Res. Soc. Jpn. , vol.13 , pp. 129-135
    • Iri, M.1
  • 17
    • 0001332760 scopus 로고    scopus 로고
    • A computational study of search strategies for mixed integer programming
    • Preprint, to appear
    • Linderoth, J., Savalsbergh, M. (1997): A computational study of search strategies for mixed integer programming. Preprint, to appear in INFORMS J. Comput.
    • (1997) INFORMS J. Comput.
    • Linderoth, J.1    Savalsbergh, M.2
  • 19
    • 0039235644 scopus 로고
    • Shortest paths, single origin-destination network design and associated polyhedra
    • Magnanti, T.L., Mirchandani, P. (1993): Shortest paths, single origin-destination network design and associated polyhedra. Networks 23, 103-121
    • (1993) Networks , vol.23 , pp. 103-121
    • Magnanti, T.L.1    Mirchandani, P.2
  • 20
    • 0001770643 scopus 로고
    • The convex hull of two core capacitated network design problems
    • Magnanti, T.L., Mirchandani, P., Vachani, R. (1993): The convex hull of two core capacitated network design problems. Math. Program. 60, 233-250
    • (1993) Math. Program. , vol.60 , pp. 233-250
    • Magnanti, T.L.1    Mirchandani, P.2    Vachani, R.3
  • 21
    • 0001258594 scopus 로고
    • Modeling and solving the two-facility network loading problem
    • Magnanti, T.L., Mirchandani, P., Vachani, R. (1995): Modeling and solving the two-facility network loading problem. Oper. Res. 43, 142-157
    • (1995) Oper. Res. , vol.43 , pp. 142-157
    • Magnanti, T.L.1    Mirchandani, P.2    Vachani, R.3
  • 22
    • 0000185938 scopus 로고
    • Edge-disjoint spanning trees of finite graphs
    • Nash-Williams, C.S.J.A. (1961): Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. 36, 199-208
    • (1961) J. Lond. Math. Soc. , vol.36 , pp. 199-208
    • Nash-Williams, C.S.J.A.1
  • 24
    • 0015095649 scopus 로고
    • On feasibility conditions of multicommodity flows in networks
    • Onaga, K., Kakusho, O. (1971): On feasibility conditions of multicommodity flows in networks. IEEE Trans. Circuit Theory CT-18, 4, 425-129
    • (1971) IEEE Trans. Circuit Theory CT-18 , vol.4 , pp. 425-1129
    • Onaga, K.1    Kakusho, O.2
  • 25
    • 0023313723 scopus 로고
    • Optimization of a 532-city traveling salesman problem by branch-and-cut
    • Padberg, M., Rinaldi, G. (1987): Optimization of a 532-city traveling salesman problem by branch-and-cut. Oper. Res. Lett. 6, 1-7
    • (1987) Oper. Res. Lett. , vol.6 , pp. 1-7
    • Padberg, M.1    Rinaldi, G.2
  • 26
    • 0026124209 scopus 로고
    • A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
    • Padberg, M., Rinaldi, G. (1991): A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 60-100
    • (1991) SIAM Rev. , vol.33 , pp. 60-100
    • Padberg, M.1    Rinaldi, G.2
  • 27
    • 0001547772 scopus 로고
    • Lot-sizing with constant batches: Formulation and valid inequalities
    • Pochet, Y., Wolsey, L.A. (1993): Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. 18, 767-785
    • (1993) Math. Oper. Res. , vol.18 , pp. 767-785
    • Pochet, Y.1    Wolsey, L.A.2
  • 28
    • 0008970476 scopus 로고
    • An improved branch-and-bound method for integer programming
    • Tomlin, J. (1971): An improved branch-and-bound method for integer programming. Oper. Res. 19, 1070-1075
    • (1971) Oper. Res. , vol.19 , pp. 1070-1075
    • Tomlin, J.1
  • 29
    • 84963041976 scopus 로고
    • On the problem of decomposing a graph into n connected factors
    • Tutte, W.T. (1961): On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. 36, 221-230
    • (1961) J. Lond. Math. Soc. , vol.36 , pp. 221-230
    • Tutte, W.T.1


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