A general mathematical model for a network design problem with reliability constraints and a revised formulation which seems particularly appropriate for fiber-optics networks is presented. Upper and lower bounding procedures based on continuous relaxations of this modified formulation are described. Preliminary computational results are reported. Limited computational results indicate a good performance of the algorithm, producing a gap between lower and upper bounds that is sufficiently small for a branch-and-bound procedure to be applicable.>
No takes yet. Share an insight, caveat, or question.
Gavish et al. (1989) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: