Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10347380 | Computers & Operations Research | 2005 | 16 Pages |
Abstract
We report the results of our computational experiments using the CPLEX software, on instances comprising up to 70 antennae or six concentrator sites. An analysis provides insight into the behavior of the lower bound obtained by the LP relaxation of the model, in response to the network density. This lower bound can be improved by adding some valid inequalities. We show that an interesting cut can be obtained by approximating the minimum number of rings in any feasible solution. This can be achieved by solving a “minimum capacitated partition problem”. Finally, we compare the lower bound to the heuristic solution value for a set of instances.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Alain Billionnet, Sourour Elloumi, Leila Grouz Djerbi,