Loading...
Please wait, while we are loading the content...
A tabu search heuristic for the design of two-connected networks with bounded rings
| Content Provider | Semantic Scholar |
|---|---|
| Author | Fortz, Bernard Labbé, Martine |
| Copyright Year | 2002 |
| Abstract | We present a tabu search heuristic for a network design problem which consists in determining at minimum cost a two-connected network such that the shortest cycle to which each edge belongs (a "ring") does not exceed a given length K. Numerical results are provided for randomly generated graphs and graphs coming from real-world applications. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.poms.ucl.ac.be/staff/bf/en/IAG74-02.pdf |
| Alternate Webpage(s) | http://smg.ulb.ac.be/Preprints/FullText/Fortz02_14.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |