Node selection strategies in interval branch and bound algorithms (Q5964243): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1922735383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounding in inner regions for global optimization under inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in computational mixed integer programming -- a look back from the other side of the tipping point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with a new selection criterion in a fast interval optimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 681: INTBIS, a portable interval Newton/bisection package / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractor programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New subinterval selection criteria for interval global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision Direction Selection in Interval Methods for Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: KBFS: K-Best-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: New interval methods for constrained global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive constructive interval disjunction: algorithms and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reliable affine relaxation method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization and Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive Interval Disjunction / rank
 
Normal rank

Latest revision as of 12:43, 11 July 2024

scientific article; zbMATH DE number 6546937
Language Label Description Also known as
English
Node selection strategies in interval branch and bound algorithms
scientific article; zbMATH DE number 6546937

    Statements

    Node selection strategies in interval branch and bound algorithms (English)
    0 references
    0 references
    0 references
    0 references
    29 February 2016
    0 references
    0 references
    intervals
    0 references
    global optimization
    0 references
    node selection
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references