On the public citation graph
Multicriteria Network Design Using Evolutionary Algorithm
0 signed · 51 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1998.0930openalex-snapshot
Bicriteria Network Design Problems
inferredcites →https://doi.org/10.1007/0-306-48056-5_8openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/3-540-45356-3_83openalex-snapshot
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
inferredcites →https://doi.org/10.1007/978-0-387-36797-2openalex-snapshot
Evolutionary Algorithms for Solving Multi-Objective Problems
inferredcites →https://doi.org/10.1007/978-1-4757-5184-0openalex-snapshot
Evolutionary Algorithms for Solving Multi-Objective Problems
inferredcites →https://doi.org/10.1007/bf01096763openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/s00453-001-0038-2openalex-snapshot
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0167-8191(95)00010-0openalex-snapshot
Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
inferredcites →https://doi.org/10.1023/a:1018919205346openalex-snapshot
Genetic algorithms and network ring design
inferredcites →https://doi.org/10.1109/2.607086openalex-snapshot
Using genetic algorithms to design mesh networks
inferredcites →https://doi.org/10.1109/24.210272openalex-snapshot
Topological optimization of a communication network subject to a reliability constraint
inferredcites →https://doi.org/10.1109/24.376523openalex-snapshot
Genetic-algorithm-based reliability optimization for computer network expansion
inferredcites →https://doi.org/10.1109/3468.541346openalex-snapshot
An integrated system for designing minimum cost survivable telecommunications networks
inferredcites →https://doi.org/10.1109/3468.650319openalex-snapshot
Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation
inferredcites →https://doi.org/10.1109/4235.661548openalex-snapshot
Local search genetic algorithm for optimal design of reliable networks
inferredcites →https://doi.org/10.1109/4235.996017openalex-snapshot
A fast and elitist multiobjective genetic algorithm: NSGA-II
inferredcites →https://doi.org/10.1109/43.331412openalex-snapshot
An edge-based heuristic for Steiner routing
inferredcites →https://doi.org/10.1109/49.245906openalex-snapshot
Topological design of interconnected LAN/MAN networks
inferredcites →https://doi.org/10.1109/90.234851openalex-snapshot
Multicast routing for multimedia communication
inferredcites →https://doi.org/10.1109/90.541324openalex-snapshot
Topological design of local-area networks using genetic algorithms
inferredcites →https://doi.org/10.1109/tcom.1977.1093709openalex-snapshot
On the Topological Design of Distributed Computer Networks
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1145/326619.326733openalex-snapshot
Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees
inferredcites →https://doi.org/10.1162/106365600568167openalex-snapshot
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
inferredcites →https://doi.org/10.1162/106365602760234108openalex-snapshot
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
inferredcites →https://doi.org/10.1162/106365602760234117openalex-snapshot
Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Genetic Algorithm
inferredcites →https://doi.org/10.3929/ethz-a-004284029openalex-snapshot
SPEA2: Improving the strength pareto evolutionary algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.5281/zenodo.1079535openalex-extracted
Evolutionary Algorithms For The Multiobjective Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/1-84628-137-7_2openalex-snapshot
Recent Trends in Evolutionary Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/11513575_7openalex-snapshot
Running Time Analysis of a Multiobjective Evolutionary Algorithm on Simple and Hard Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-10701-6_17openalex-snapshot
Evolutionary Algorithms for the Multi Criterion Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-32964-7_7openalex-snapshot
Network Topology Planning Using MOEA/D with Objective-Guided Operators
inferred← citeshttps://doi.org/10.1007/s00521-017-3191-5openalex-snapshot
Fuzzy goal programming-based ant colony optimization algorithm for multi-objective topology design of distributed local area networks
inferred← citeshttps://doi.org/10.1007/s10489-009-0206-7openalex-snapshot
Integrating multi-objective genetic algorithm based clustering and data partitioning for skyline computation
inferred← citeshttps://doi.org/10.1007/s11107-005-2484-2openalex-snapshot
Multihop Virtual Topology Design in WDM Optical Networks for Self-Similar Traffic
inferred← citeshttps://doi.org/10.1016/j.asoc.2009.08.037openalex-snapshot
Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.007openalex-snapshot
Analysis of a Multiobjective Evolutionary Algorithm on the 0–1 knapsack problem
inferred← citeshttps://doi.org/10.1016/j.tre.2017.02.002openalex-snapshot
The multi-criteria constrained shortest path problem
inferred← citeshttps://doi.org/10.1080/03772063.2005.11416397openalex-snapshot
Static and Dynamic Connection Establishment in WDM Optical Networks: A Review
inferred← citeshttps://doi.org/10.1109/his.2008.86openalex-snapshot
A Hybridised Evolutionary Algorithm for Multi-Criterion Minimum Spanning Tree Problems
inferred← citeshttps://doi.org/10.1109/icsamos.2008.4664849openalex-snapshot
Multi-objective routing and topology optimization in networked embedded systems
inferred← citeshttps://doi.org/10.1109/imcsit.2008.4747351openalex-snapshot
Communication network design using Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1109/saso.2012.34openalex-snapshot
Constructing Communication Networks with Evolved Digital Organisms
inferred← citeshttps://doi.org/10.1109/tevc.2011.2125968openalex-snapshot
Solving Multicommodity Capacitated Network Design Problems Using Multiobjective Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1109/tevc.2011.2173579openalex-snapshot
Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design
inferred← citeshttps://doi.org/10.1145/1276958.1277341openalex-snapshot
Multiobjective network design for realistic traffic models
inferred← citeshttps://doi.org/10.17485/ijst/2015/v8i28/74590openalex-snapshot
An Evolutionary Approach to Solve Network Route Optimization Problem
inferred← citeshttps://doi.org/10.31803//tg-20201215233216openalex-snapshot
Capacity Optimization in Dynamically Routing Computer Network Systems
inferred← citeshttps://doi.org/10.5555/2331751.2331758openalex-snapshot
On a multi-objective evolutionary algorithm for optimizing end-to-end performance of scientific workflows in distributed environments
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.