Efficient solutions for the far from most string problem (Q1761847): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-011-1028-7 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-011-1028-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138481196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability distribution of solution time in GRASP: an experimental investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic procedures for solving the discrete ordered median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some optimization problems in molecular biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776563 / 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: On covering problems of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel multistart algorithm for the closest string problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria inventory classification using a genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing string selection problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding similar regions in many strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms: Foundations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solutions for the Closest-String Problem via Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms and network ring design / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-011-1028-7 / rank
 
Normal rank

Latest revision as of 09:10, 11 December 2024

scientific article
Language Label Description Also known as
English
Efficient solutions for the far from most string problem
scientific article

    Statements

    Efficient solutions for the far from most string problem (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    computational biology
    0 references
    molecular structure prediction
    0 references
    protein and sequences alignment
    0 references
    combinatorial optimization
    0 references
    metaheuristics
    0 references

    Identifiers