scholarly journals Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

Algorithmica ◽  
2001 ◽  
Vol 31 (1) ◽  
pp. 58-78 ◽  
Author(s):  
R. Ravi ◽  
M. V. Marathe ◽  
S. S. Ravi ◽  
D. J. Rosenkrantz ◽  
H. B. Hunt III
Keyword(s):  
Approximation Algorithms ◽  
Network Design ◽  
Minimum Cost ◽  
Design Problems ◽  
Network Design Problems

scholarly journals Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

2009 ◽  
pp. 241-266
Author(s):  
R. Ravi ◽  
Madhav V. Marathe ◽  
S. S. Ravi ◽  
Daniel J. Rosenkrantz ◽  
Harry B. Hunt
Keyword(s):  
Approximation Algorithms ◽  
Network Design ◽  
Minimum Cost ◽  
Design Problems ◽  
Network Design Problems

Approximation Algorithms for Network Design Problems on Bounded Subsets

1996 ◽  
Vol 21 (2) ◽  
pp. 403-414 ◽  
Author(s):  
Dorit S. Hochbaum ◽  
Joseph (Seffi) Naor
Keyword(s):  
Approximation Algorithms ◽  
Network Design ◽  
Design Problems ◽  
Network Design Problems

Approximation Algorithms for Integrated Distribution Network Design Problems

2013 ◽  
Vol 25 (3) ◽  
pp. 572-584 ◽  
Author(s):  
Yu Li ◽  
Jia Shu ◽  
Xi Wang ◽  
Naihua Xiu ◽  
Dachuan Xu ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Network Design ◽  
Distribution Network ◽  
Design Problems ◽  
Distribution Network Design ◽  
Network Design Problems

A GENETIC ALGORITHM FOR THE DESIGN OF MINIMUM-COST TWO-CONNECTED NETWORKS WITH BOUNDED RINGS

2005 ◽  
Vol 05 (02) ◽  
pp. 267-281 ◽  
Author(s):  
MARIO VENTRESCA ◽  
BEATRICE M. OMBUKI
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Network Design ◽  
Branch And Bound ◽  
Minimum Cost ◽  
Numerical Results ◽  
Solution Quality ◽  
Design Problems ◽  
Network Design Problems

This paper presents a genetic algorithm for designing minimum-cost two-connected networks such that the shortest cycle to which each edge belongs to does not exceed a given length. We provide numerical results based on randomly generated graphs found in the literature and compare the solution quality with that of tabu search and branch and bound. The results demonstrate the effectiveness of our algorithm and show promise for tackling ring-based network design problems. This paper is among the first to document the implementation of a genetic algorithm for the design of two-connected networks with the added constraint of bounded rings.

Sign in / Sign up

Export Citation Format

Share Document