SEARCH

SEARCH BY CITATION

Cited in:

CrossRef

This article has been cited by:

  1. 1
    Roman E. Shangin, Panos Pardalos, Heuristics for the network design problem with connectivity requirements, Journal of Combinatorial Optimization, 2015,

    CrossRef

  2. 2
    Oya Ekin Karaşan, A. Ridha Mahjoub, Onur Özkök, Hande Yaman, Survivability in Hierarchical Telecommunications Networks Under Dual Homing, INFORMS Journal on Computing, 2014, 26, 1, 1

    CrossRef

  3. 3
    Quentin Botton, Bernard Fortz, Luis Gouveia, Michael Poss, Benders Decomposition for the Hop-Constrained Survivable Network Design Problem, INFORMS Journal on Computing, 2013, 25, 1, 13

    CrossRef

  4. 4
    Yongjia Song, James R. Luedtke, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, Mathematical Programming Computation, 2013, 5, 4, 397

    CrossRef

  5. 5
    Anantaram Balakrishnan, Mihai Banciu, Karolina Glowacka, Prakash Mirchandani, Hierarchical approach for survivable network design, European Journal of Operational Research, 2013, 225, 2, 223

    CrossRef

  6. 6
    Richard Li-Yang Chen, Cynthia A. Phillips, k-Edge Failure Resilient Network Design, Electronic Notes in Discrete Mathematics, 2013, 41, 375

    CrossRef

  7. 7
    Renato E.N. Moraes, Celso C. Ribeiro, Power optimization in ad hoc wireless network topology control with biconnectivity requirements, Computers & Operations Research, 2013, 40, 12, 3188

    CrossRef

  8. 8
    Ivana Ljubić, Petra Mutzel, Bernd Zey, Stochastic Survivable Network Design Problems, Electronic Notes in Discrete Mathematics, 2013, 41, 245

    CrossRef

  9. 9
    Marco Carvalho, Alexey Sorokin, Vladimir Boginski, Balabhaskar Balasundaram, Topology design for on-demand dual-path routing in wireless networks, Optimization Letters, 2013, 7, 4, 695

    CrossRef

  10. 10
    Prakash Mirchandani, David Simchi-Levi, Handbook of Graph Theory, Second Edition, 2013,

    CrossRef

  11. 11
    Ivana Ljubić, A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation, Networks, 2010, 56, 3
  12. 12
    Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling, A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation, Networks, 2010, 55, 4
  13. 13
    Gunhak Lee, Alan T. Murray, Maximal covering with network survivability requirements in wireless mesh networks, Computers, Environment and Urban Systems, 2010, 34, 1, 49

    CrossRef

  14. 14
    Markus Chimani, Maria Kandyba, Ivana Ljubić, Petra Mutzel, Orientation-based models for {0,1,2}-survivable network design: theory and practice, Mathematical Programming, 2010, 124, 1-2, 413

    CrossRef

  15. 15
    Jennifer Edmonds, Ronald Armstrong, A mixed integer programming model for multiple stage adaptive testing, European Journal of Operational Research, 2009, 193, 2, 342

    CrossRef

  16. 16
    Anantaram Balakrishnan, Prakash Mirchandani, Harihara Prasad Natarajan, Connectivity Upgrade Models for Survivable Network Design, Operations Research, 2009, 57, 1, 170

    CrossRef

  17. 17
    Kavinesh J. Singh, Andy B. Philpott, R. Kevin Wood, Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems, Operations Research, 2009, 57, 5, 1271

    CrossRef

  18. 18
    Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte, Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints, Networks, 2009, 53, 2
  19. 19
    Yogesh K. Agarwal, Polyhedral structure of the 4-node network design problem, Networks, 2009, 54, 3
  20. 20
    Dong Liang, Wilbert E. Wilhelm, Decomposition schemes and acceleration techniques in application to production–assembly–distribution system design, Computers & Operations Research, 2008, 35, 12, 4010

    CrossRef

  21. 21
    Luís Gouveia, Pedro Patrício, Amaro de Sousa, Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM, Networks and Spatial Economics, 2008, 8, 1, 3

    CrossRef

  22. 22
    Alper Atamtürk, Deepak Rajan, Partition inequalities for capacitated survivable network design based on directed p-cycles, Discrete Optimization, 2008, 5, 2, 415

    CrossRef

  23. 23
    E A Cabral, E Erkut, G Laporte, R A Patterson, Wide area telecommunication network design: application to the Alberta SuperNet, Journal of the Operational Research Society, 2008, 59, 11, 1460

    CrossRef

  24. You have free access to this content24
    Walid Ben-Ameur, José Neto, Acceleration of cutting-plane and column generation algorithms: Applications to network design, Networks, 2007, 49, 1
  25. 25
    Irene Casas, Amit Malik, Eric M. Delmelle, Mark H. Karwan, Rajan Batta, An Automated Network Generation Procedure for Routing of Unmanned Aerial Vehicles (UAVs) in a GIS Environment, Networks and Spatial Economics, 2007, 7, 2, 153

    CrossRef

  26. 26
    Hervé Kerivin, A. Ridha Mahjoub, Design of Survivable Networks: A survey, Networks, 2005, 46, 1