General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Laveen N. Kanal / rank
Normal rank
 
Property / author
 
Property / author: Laveen N. Kanal / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q55924037 / 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.1016/0004-3702(84)90004-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043418025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of algorithms for finite state sequential decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Dominance Relations in Branch-and-Bound Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound procedure and state—space representation of combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of alpha-beta pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing decision trees through heuristically guided search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: General Formulation and Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax algorithm better than alpha-beta? / rank
 
Normal rank

Latest revision as of 12:40, 14 June 2024

scientific article
Language Label Description Also known as
English
General branch and bound, and its relation to \(A^*\) and \(AO^*\)
scientific article

    Statements

    General branch and bound, and its relation to \(A^*\) and \(AO^*\) (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    0 references
    0 references
    0 references
    Branch and bound
    0 references
    heuristic search procedures
    0 references
    0 references
    0 references