Computing the metric dimension of graphs by genetic algorithms (Q849088): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q440962 / rank
Normal rank
 
Property / author
 
Property / author: Vera V. Kovacevic-Vujcic / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GLOB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-007-9154-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968600356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining test problems via Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree search algorithm for the crew scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the metric dimension of some families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3625853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Metric Dimension of Cartesian Products of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvability in graphs and the metric dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvability and the upper dimension of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some interconnections between combinatorial optimization and extremal graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The metric dimension of Cayley digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4680187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic and hybrid algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guidelines for the use of meta-heuristics in combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving graph colouring algorithms and heuristics using a novel representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single period inventory model of a deteriorating item sold from two shops with shortage via genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core concept for the Multidimensional Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic diversification and intensification in local search for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Resolvability of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connected Resolving Decompositions in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4803862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5324298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms for solving the discrete ordered median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples in exact phase transitions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:18, 2 July 2024

scientific article
Language Label Description Also known as
English
Computing the metric dimension of graphs by genetic algorithms
scientific article

    Statements

    Computing the metric dimension of graphs by genetic algorithms (English)
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    graph theory
    0 references
    metric dimension
    0 references
    evolutionary approach
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references