Article ID: | iaor20021509 |
Country: | United States |
Volume: | 48 |
Issue: | 6 |
Start Page Number: | 866 |
End Page Number: | 877 |
Publication Date: | Nov 2000 |
Journal: | Operations Research |
Authors: | Labb Martine, Maffioli Francesco, Fortz Bernard |
Keywords: | programming: integer, programming: branch and bound |
We study the problem of designing at minimum cost a two-connected network such that the shortest cycle to which each edge belongs (a ‘mesh’) does not exceed a given length