Particle swarm optimisation for the design of two-connected networks with bounded rings

No abstract is available for this paper.

• Publication year

  2008

• Venue

  International Journal of High Performance Systems Architecture

• Publication date

  2008-03-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1504/IJHPSA.2008.024206
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Search Difficulty of Two-Connected Ring-based Topological Network Designs

  2007cited by this paper
• An Improved Particle Swarm Optimization for Evolving Feedforward Artificial Neural Networks

  2007cited by this paper
• A hybrid particle swarm optimization for job shop scheduling problem

  2006cited by this paper
• A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings

  2005cited by this paper
• Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem

  2005cited by this paper
• Robust estimation of camera rotation,translation and focal length at high outlier rates

  2004cited by this paper
• Two-Connected Networks with Rings of Bounded Cardinality

  2004cited by this paper
• Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

  2004cited by this paper
• An Evolutionary Design Algorithm for Ring-based SDH optical core networks

  2004cited by this paper
• Advanced Modelling Techniques for Designing Survivable Telecommunications Networks

  2003influential reference
• Optimal Design of Reliable Computer Networks: A Comparison of Metaheuristics

  2003cited by this paper
• Polyhedral results for two-connected networks with bounded rings

  2002influential reference
• A tabu search heuristic for the design of two-connected networks with bounded rings

  2002influential reference
• An Evolutionary Algorithm Approach to the Design of Minimum Cost Survivable Networks with Bounded Rings

  2001cited by this paper
• Capacity design of ATM rings with genetic algorithms

  2000cited by this paper
• Design of Survivable Networks with Bounded Rings

  2000influential reference
• Solving the Two-Connected Network with Bounded Meshes Problem

  2000influential reference
• Design of Stacked Self-Healing Rings Using a Genetic Algorithm

  2000cited by this paper
• Genetic algorithms and network ring design

  1999cited by this paper
• EVOLUTIONARY DESIGN ALGORITHM FOR OPTIMAL LAYOUT OF TREE NETWORKS

  1995influential reference
• Reliability optimization of communication networks using simulated annealing

  1993influential reference
• Network Design and Transportation Planning: Models and Algorithms

  1984cited by this paper
• Topological layout of links for optimizing the s-t reliability in a computer communication system

  1982influential reference
• The NP-Completeness Column: An Ongoing Guide

  1982influential reference
• Graphs, Networks, and Algorithms

  1980cited by this paper

• Evolving optical interconnection topology: from survivable rings to resilient meshes

  2020cites this paper
• Intrinsically Resilient Optical Backbones: An Efficient Ring-Based Interconnection Paradigm

  2019cites this paper
• Particle swarm optimization for two-connected networks with bounded rings

  2009cites this paper