---

Gouveia L., Patrício P., de Sousa A.F., "Compact Models for Hop-Constrained Node Survivable Network Design: an Application to MPLS", in “Telecommunications Planning: Innovations in Pricing, Network Design and Management”, G. Anandaligam e S. Raghavan (editors), Springer, Chapter 9, pp. 167-180, 2006

---

Return to Homepage

---

Citations:

1. Huygens D., Labbé M., Ridha Mahjoub A., Pesneau P., “The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut”, Networks, Vol. 49, No. 1, January 2007, pages 116-133

2. Huygens D., Ridha Mahjoub A., “Integer programming formulations for the two 4-hop-constrained paths problem”, Networks, Vol. 49, No. 2, March 2007, pages 135-144

3. Bendali F., Diarrassouba I., Mahjoub A.R., Mailfert J., “The k edge-disjoint 3-hop-constrained paths polytope”, Discrete Optimization, Elsevier, 2010, doi: 10.1016/j.disopt.2010.05.001

4. Bley A., Neto J., “Approximability of 3- and 4-hop bounded disjoint paths problems”, Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Springer, Vol. 6080, 2010, pages 205-218

Return to Homepage