Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem-Reference-Cited by-同舟云学术

Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem

Published:2015-12-26 Issue:2 Volume:67 Page:148-169
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:NETWORKS

Author:

Diarrassouba I.¹,Gabrel V.²,Mahjoub A. R.²,Gouveia L.³,Pesneau P.⁴

Affiliation:

1. Laboratoire LMAH, Université du Havre; 25 Rue Philippe Lebon 76600 Le Havre France

2. Laboratoire LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny; 75775 Paris Cedex 16 France

3. Departamento de Estatística e Investigação Operacional, Centro de Investigação Operacional, Faculdade de Ciênçias; Universidade de Lisboa; Portugal

4. University of Bordeaux, INRIA Bordeaux - Sud-Ouest, IMB UMR 5251; France

Funder

National Funding from FCT-Fundaç ā o para a Ciência e a Tecnologia, under the project: PEst-OE/MAT/UI0152

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference35 articles.

1. http://www-01.ibm.com/support/knowledgecenter/SSSA5P_12.5.1/maps/ic-homepage.html

2. On two-connected subgraph polytopes;Barahona;Discrete Math,1995

3. A Branch-and-cut algorithm for the k-edge connected subgraph problem;Bendali;Networks,2010

4. The k-edge-disjoint 3-hop-constrained paths polytope;Bendali;Discrete Optim,2010

5. Benders decomposition for the hop-constrained survivable network design problem;Botton;INFORMS J Comput,2013

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimization algorithms for the k edge-connected L-hop-constrained network design problem;Soft Computing;2024-02-05

2. Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut;Computers & Industrial Engineering;2023-10

3. Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties;European Journal of Operational Research;2023-07

4. Hop-Constrained Metric Embeddings and their Applications;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. Tree embeddings for hop-constrained network design;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15