Computing the metric dimension of graphs by genetic algorithms
From MaRDI portal
Recommendations
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- Computing minimal doubly resolving sets of graphs
- Computing the partition metric dimension of graphs based on genetic algorithm
- Computing the \(k\)-metric dimension of graphs
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
Cites work
- scientific article; zbMATH DE number 5844285 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1737515 (Why is no real title available?)
- scientific article; zbMATH DE number 2172799 (Why is no real title available?)
- scientific article; zbMATH DE number 1895692 (Why is no real title available?)
- A single period inventory model of a deteriorating item sold from two shops with shortage via genetic algorithm
- A tabu search algorithm for the quadratic assignment problem
- A tree search algorithm for the crew scheduling problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- An efficient genetic algorithm for the uncapacitated multiple allocation \(p\)-hub median problem
- Ant colony optimization.
- Connected Resolvability of Graphs
- Evolutionary computation. 1. Basic algorithms and operators
- Genetic algorithm for solving uncapacitated multiple allocation hub location problem
- Genetic algorithms for solving the discrete ordered median problem
- Genetic and hybrid algorithms for graph coloring
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Improving graph colouring algorithms and heuristics using a novel representation
- Landmarks in graphs
- Many hard examples in exact phase transitions
- Obtaining test problems via Internet
- On Connected Resolving Decompositions in Graphs
- On some interconnections between combinatorial optimization and extremal graph theory
- On the Metric Dimension of Cartesian Products of Graphs
- On the metric dimension of Cartesian products of graphs
- On the metric dimension of some families of graphs
- Optimization by simulated annealing
- Probabilistic diversification and intensification in local search for vehicle routing
- Resolvability and the upper dimension of graphs
- Resolvability in graphs and the metric dimension of a graph
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- The core concept for the Multidimensional Knapsack problem
- The metric dimension and metric independence of a graph
- The metric dimension of Cartesian products of graphs
- The metric dimension of Cayley digraphs
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Variable neighborhood search: Principles and applications
Cited in
(18)- Minimal doubly resolving sets of prism graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- On the metric dimension of infinite graphs
- A genetic algorithm for circulant Euclidean distance matrices
- scientific article; zbMATH DE number 1185304 (Why is no real title available?)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- Computing minimal doubly resolving sets of graphs
- Computing the partition metric dimension of graphs based on genetic algorithm
- The 0-1 ant colony conditional coloring resolving algorithm for solving the metric dimension problem of graphs
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
- Learning to compute the metric dimension of graphs
- An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes
- Symmetry properties of resolving sets and metric bases in hypercubes
- Resolving the hypercube
- Low-dimensional representation of genomic sequences
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
This page was built for publication: Computing the metric dimension of graphs by genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849088)
