HUYGENS, D., LABBE, M., RIDHA MAHJOUB, A., & PESNEAU, P. (2007, Januar 1). The two-edge connected Hop-constrained Network Design Problem : Valid inequalities and branch-and-cut. 49(1). New York, NY: John Wiley & Sons, 2007. Abgerufen von http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=18405631

HUYGENS, David, LABBE, Martine, RIDHA MAHJOUB, A und PESNEAU, Pierre, 2007. The two-edge connected Hop-constrained Network Design Problem : Valid inequalities and branch-and-cut. In: [online]. New York, NY: John Wiley & Sons, 2007. 1 Januar 2007. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=18405631

HUYGENS, D., M. LABBE, A. RIDHA MAHJOUB, und P. PESNEAU. The two-edge connected Hop-constrained Network Design Problem : Valid inequalities and branch-and-cut. Nr. 1, New York, NY: John Wiley & Sons, 2007., 2007, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=18405631.

HUYGENS, D., LABBE, M., RIDHA MAHJOUB, A. und PESNEAU, P. (2007), „The two-edge connected Hop-constrained Network Design Problem : Valid inequalities and branch-and-cut“, in , Bd. 49, New York, NY: John Wiley & Sons, 2007., verfügbar unter: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=18405631.