Digital data networks design using genetic algorithms
type: Item
instance of: scholarly article
title: Digital data networks design using genetic algorithms
zbMATH Open document ID: 0979.90015
DOI: 10.1016/S0377-2217(99)00329-X
author: Chao-Hsien Chu
author: G. Premkumar
author: Hsinghua Chou
published in: European Journal of Operational Research
publication date: 2001-05-01T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1548100
zbMATH Keywords: telecommunications
zbMATH Keywords: genetic algorithms
zbMATH Keywords: network design
zbMATH Keywords: tabu search
describes a project that uses: OR-Library
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Optimized Crossover for the Independent Set Problem
cites work: Q3056948
cites work: Path assignment for call routing: An application of tabu search
cites work: Q5687948
cites work: Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
cites work: Tabu Search—Part I
cites work: Least-cost network topology design for a new service: An application of tabu search
cites work: Genetic algorithms and tabu search: Hybrids for optimization
cites work: Bandwidth Packing: A Tabu Search Approach
cites work: Q4354785
cites work: Q4692508
cites work: Q4365130
cites work: Q4079017
cites work: The Steiner tree problem
cites work: Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
cites work: Sonet ring sizing with genetic algorithms
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Optimal network partitioning for fault-tolerant network management using evolutionary programming
cites work: An approach to a problem in network design using genetic algorithms
cites work: A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
cites work: Tabu Search Applied to the Quadratic Assignment Problem
cites work: On tabu search for the location of interacting hub facilities
cites work: An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
cites work: Steiner problem in networks: A survey
cites work: Euclidean Steiner minimum trees: An improved exact algorithm
cites work: A faster approximation algorithm for the Steiner tree problem in graphs
full work available at URL: s0377-2217(99)00329-x
OpenAlex ID: W2030895630
Recommended article: Network design techniques using adapted genetic algorithms
Recommended article: An approach to a problem in network design using genetic algorithms
Recommended article: Genetic algorithms and network ring design
Recommended article: A genetic algorithm approach on tree-like telecommunication network design problem
Recommended article: Q4901068
Recommended article: An effective genetic algorithm for network coding
description: scientific article; zbMATH DE number 1548100