On the public citation graph

Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem

0 signed · 45 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1002/net.10069openalex-snapshot
Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
inferredcites →https://doi.org/10.1007/3-540-46521-9_2openalex-snapshot
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
inferredcites →https://doi.org/10.1007/978-3-540-24854-5_122openalex-snapshot
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
inferredcites →https://doi.org/10.1007/978-3-642-11164-8_12openalex-snapshot
Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter
inferredcites →https://doi.org/10.1007/978-3-642-14834-7_22openalex-snapshot
Assessing the Performance of Bi-objective MST for Euclidean and Non-Euclidean Instances
inferredcites →https://doi.org/10.1007/978-981-10-8657-1_44openalex-snapshot
Effective Heuristics for the Bi-objective Euclidean Bounded Diameter Minimum Spanning Tree Problem
inferredcites →https://doi.org/10.1007/s00500-006-0142-yopenalex-snapshot
Improved heuristics for the bounded-diameter minimum spanning tree problem
inferredcites →https://doi.org/10.1007/s00500-012-0869-6openalex-snapshot
An adaptive heuristic to the bounded-diameter minimum spanning tree problem
inferredcites →https://doi.org/10.1007/s10107-009-0297-2openalex-snapshot
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
inferredcites →https://doi.org/10.1007/s10462-012-9328-0openalex-snapshot
A comprehensive survey: artificial bee colony (ABC) algorithm and applications
inferredcites →https://doi.org/10.1007/s10732-008-9080-4openalex-snapshot
A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization
inferredcites →https://doi.org/10.1007/s10898-007-9149-xopenalex-snapshot
A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
inferredcites →https://doi.org/10.1007/s10898-009-9430-2openalex-snapshot
A hybrid heuristic for the diameter constrained minimum spanning tree problem
inferredcites →https://doi.org/10.1007/s11263-013-0661-9openalex-snapshot
Using Bounded Diameter Minimum Spanning Trees to Build Dense Active Appearance Models
inferredcites →https://doi.org/10.1016/0306-4379(91)90030-dopenalex-snapshot
Compression of correlated bit-vectors
inferredcites →https://doi.org/10.1016/j.asoc.2008.09.001openalex-snapshot
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.engappai.2019.103237openalex-snapshot
A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem
inferredcites →https://doi.org/10.1016/j.ins.2009.12.025openalex-snapshot
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
inferredcites →https://doi.org/10.1016/j.ins.2010.05.001openalex-snapshot
A swarm intelligence approach to the quadratic minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.swevo.2011.12.002openalex-snapshot
A swarm intelligence approach to the early/tardy scheduling problem
inferredcites →https://doi.org/10.1080/00207160211289openalex-snapshot
Random-tree Diameter and the Diameter-constrained MST
inferredcites →https://doi.org/10.1109/cec.2008.4631221openalex-snapshot
A new hybrid Genetic Algorithm for solving the Bounded Diameter Minimum Spanning Tree problem
inferredcites →https://doi.org/10.1109/icpads.1994.590400openalex-snapshot
A tree-based distributed algorithm for the K-entry critical section problem
inferredcites →https://doi.org/10.1109/indicon.2014.7030575openalex-snapshot
Parallel heuristics for the bounded diameter minimum spanning tree problem
inferredcites →https://doi.org/10.1109/infcom.1993.253399openalex-snapshot
Multicasting in a linear lightwave network
inferredcites →https://doi.org/10.1109/saint.2008.68openalex-snapshot
Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
inferredcites →https://doi.org/10.1111/exsy.12610openalex-snapshot
Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem
inferredcites →https://doi.org/10.1145/1143997.1144185openalex-snapshot
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
inferredcites →https://doi.org/10.1145/1498698.1498699openalex-snapshot
Greedy heuristics for the bounded diameter minimum spanning tree problem
inferredcites →https://doi.org/10.1145/1569901.1569939openalex-snapshot
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
inferredcites →https://doi.org/10.1145/1947940.1948036openalex-snapshot
Improvement of bounded-diameter MST instances with hybridization of multi-objective EA
inferredcites →https://doi.org/10.1145/58564.59295openalex-snapshot
A tree-based algorithm for distributed mutual exclusion
inferredcites →https://doi.org/10.1145/952532.952678openalex-snapshot
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem
inferredcites →https://doi.org/10.1287/ijoc.2014.0617openalex-snapshot
New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-53966-4_15openalex-snapshot
A Hybrid Steady-State Genetic Algorithm for the Minimum Conflict Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/s10586-024-04895-5openalex-snapshot
Victoria Amazonica optimization algorithm based on adaptive mutation factor and mathematical distribution for solving minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110205openalex-snapshot
Two phases of metaheuristic techniques for the minimum conflict weighted spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107554openalex-snapshot
List-based simulated annealing algorithm with novel encoding structure for the bounded diameter minimum spanning tree problem
inferred← citeshttps://doi.org/10.1108/k-01-2024-0096openalex-snapshot
A crew task allocation and sequencing method considering workload distribution and minimum task completion time
inferred← citeshttps://doi.org/10.1145/3583133.3590575openalex-snapshot
Simulated Annealing Algorithm for the Bounded Diameter Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1371/journal.pone.0274625openalex-snapshot
Multi-period uncertain portfolio selection model with prospect utility function
inferred← citeshttps://doi.org/10.2139/ssrn.5442984openalex-snapshot
Intelligent Multi-Objective Optimization ABC Algorithm Based on Dynamic Weights and Average Cognitive Strategy
inferred← citeshttps://doi.org/10.3390/computers14100422openalex-snapshot
Hybrid MOCPO–AGE-MOEA for Efficient Bi-Objective Constrained Minimum Spanning Trees
inferred← citeshttps://doi.org/10.3390/jmse13081518openalex-snapshot
Maritime Rescue Task Allocation and Sequencing Using MOEA/D with Adaptive Operators and Idle-Time-Aware Decoding Strategy
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.