On estimating workload in interval branch-and-bound global optimization algorithms (Q2392108): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-011-9771-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077894211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel methods for verified global optimization practice and theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic rejection in interval global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Early Estimates of the Size of Branch-and-Bound Trees / 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: A parallel interval method implementation for global optimization using dynamic load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving combinatorial optimization problems in parallel: methods and techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel branch-and-bound algorithm for multicommodity location with balancing requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4445267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new parallel method for verified global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3584100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Efficiency of Backtrack Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple approaches to parallel branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Interval Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Methods for Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel processing of discrete problems. Proceedings of a workshop, IMA, Minneapolis, MN, USA, May 12--16, 1997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel depth first search. I: Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the selection of subdivision directions in interval branch-and-bound methods for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization / rank
 
Normal rank

Latest revision as of 17:29, 6 July 2024

scientific article
Language Label Description Also known as
English
On estimating workload in interval branch-and-bound global optimization algorithms
scientific article

    Statements

    On estimating workload in interval branch-and-bound global optimization algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 August 2013
    0 references
    0 references
    global optimization
    0 references
    interval arithmetic
    0 references
    branch-and-bound
    0 references
    workload prediction
    0 references
    parallel algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references