Multiheuristic approach to discrete optimization problems (Q2371698): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Minimization of Nondeterministic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal NFA Problems are Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2761606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for determining relative star height and star height / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics in programming of nondeterministic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A choice of strategy in nondeterministic antagonistic games / rank
 
Normal rank

Latest revision as of 10:13, 26 June 2024

scientific article
Language Label Description Also known as
English
Multiheuristic approach to discrete optimization problems
scientific article

    Statements

    Multiheuristic approach to discrete optimization problems (English)
    0 references
    5 July 2007
    0 references
    discrete optimization
    0 references
    heuristics
    0 references
    decision making
    0 references
    uncompleted branch-and-bound method
    0 references
    dynamic risk function
    0 references
    genetic algorithm
    0 references
    0 references

    Identifiers