Theoretical comparisons of search strategies in branch-and-bound algorithms (Q4192964): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Letter to the Editor—A Note on the Branch-and-Bound Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Programming by the Filter Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Solution of Large Mixed Integer Programming Problems with Umpire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming by Implicit Enumeration and Balas’ Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack Programming / 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: Branch-and-Bound Methods: A Survey / 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: Q5626306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank

Latest revision as of 02:16, 13 June 2024

scientific article; zbMATH DE number 3631926
Language Label Description Also known as
English
Theoretical comparisons of search strategies in branch-and-bound algorithms
scientific article; zbMATH DE number 3631926

    Statements

    Theoretical comparisons of search strategies in branch-and-bound algorithms (English)
    0 references
    0 references
    0 references
    1976
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Branch-And-Bound Algorithm
    0 references
    Heuristic Search
    0 references
    Computational Complexity
    0 references
    Mathematical Programming
    0 references