A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import recommendations run Q6767936
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ins.2018.05.047 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2018.05.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2805417520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Arrays of Index Unity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strength two covering arrays: existence tables and projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic and constructive methods for covering perfect hash families and covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of mixed covering arrays of strength two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two applications (for search theory and truth functions) of Sperner type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of \(k\)-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial covering arrays: algorithms and asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering arrays of higher strength from permutation vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage algorithm for combinatorial testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for covering arrays using permutation vectors / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129760457 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.INS.2018.05.047 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: A greedy algorithm to construct covering arrays using a graph representation / rank
 
Normal rank
Property / Recommended article: A greedy algorithm to construct covering arrays using a graph representation / qualifier
 
Similarity Score: 0.8966546
Amount0.8966546
Unit1
Property / Recommended article: A greedy algorithm to construct covering arrays using a graph representation / qualifier
 
Property / Recommended article
 
Property / Recommended article: A survey of methods for constructing covering arrays / rank
 
Normal rank
Property / Recommended article: A survey of methods for constructing covering arrays / qualifier
 
Similarity Score: 0.86509657
Amount0.86509657
Unit1
Property / Recommended article: A survey of methods for constructing covering arrays / qualifier
 
Property / Recommended article
 
Property / Recommended article: Mixed optimization combinatorial method for constructing covering arrays / rank
 
Normal rank
Property / Recommended article: Mixed optimization combinatorial method for constructing covering arrays / qualifier
 
Similarity Score: 0.8642839
Amount0.8642839
Unit1
Property / Recommended article: Mixed optimization combinatorial method for constructing covering arrays / qualifier
 
Property / Recommended article
 
Property / Recommended article: Two‐stage algorithms for covering array construction / rank
 
Normal rank
Property / Recommended article: Two‐stage algorithms for covering array construction / qualifier
 
Similarity Score: 0.85876405
Amount0.85876405
Unit1
Property / Recommended article: Two‐stage algorithms for covering array construction / qualifier
 
Property / Recommended article
 
Property / Recommended article: New optimal covering arrays using an orderly algorithm / rank
 
Normal rank
Property / Recommended article: New optimal covering arrays using an orderly algorithm / qualifier
 
Similarity Score: 0.85602766
Amount0.85602766
Unit1
Property / Recommended article: New optimal covering arrays using an orderly algorithm / qualifier
 
Property / Recommended article
 
Property / Recommended article: Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search / rank
 
Normal rank
Property / Recommended article: Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search / qualifier
 
Similarity Score: 0.85394216
Amount0.85394216
Unit1
Property / Recommended article: Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search / qualifier
 
Property / Recommended article
 
Property / Recommended article: Heuristically enhanced IPO algorithms for covering array generation / rank
 
Normal rank
Property / Recommended article: Heuristically enhanced IPO algorithms for covering array generation / qualifier
 
Similarity Score: 0.8510138
Amount0.8510138
Unit1
Property / Recommended article: Heuristically enhanced IPO algorithms for covering array generation / qualifier
 
Property / Recommended article
 
Property / Recommended article: Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach / rank
 
Normal rank
Property / Recommended article: Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach / qualifier
 
Similarity Score: 0.85067767
Amount0.85067767
Unit1
Property / Recommended article: Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach / qualifier
 
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:40, 4 April 2025

scientific article
Language Label Description Also known as
English
A greedy-metaheuristic 3-stage approach to construct covering arrays
scientific article

    Statements

    A greedy-metaheuristic 3-stage approach to construct covering arrays (English)
    0 references
    9 September 2020
    0 references
    greedy algorithms
    0 references
    metaheuristic algorithms
    0 references
    covering arrays
    0 references
    3-stage approach
    0 references
    covering perfect hash families
    0 references
    simulated annealing
    0 references

    Identifiers

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