Combining interval branch and bound and stochastic search

DOI10.1155/2014/861765zbMATH Open1474.90526OpenAlexW2121981570WikidataQ59042121 ScholiaQ59042121MaRDI QIDQ1725151FDOQ1725151

Authors: Dhiranuch Bunnag 

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/861765

Recommendations

• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• An interval branch and bound algorithm for bound constrained optimization problems
• Integrating interval estimates of global optima and local search methods for combinatorial optimization problems
• Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
• A branch and bound method for stochastic integer problems under probabilistic constraints
• A branch and bound method for stochastic global optimization
• A finite branch-and-bound algorithm for two-stage stochastic integer programs
• Stochastic search algorithm with an application to multidimensional integration
• Branch and bound methods for a search problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30)

Cites Work

• A collection of test problems for constrained global optimization algorithms
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• Title not available (Why is that?)
• Title not available (Why is that?)
• On constrained optimization by interval arithmetic and interval order relations
• Interval branch and bound with local sampling for constrained global optimization
• Optimal multisections in interval branch-and-bound methods of global optimization
• Title not available (Why is that?)
• A heuristic rejection criterion in interval global optimization algorithms
• A new hybrid genetic algorithm for global optimization
• A fast memoryless interval-based algorithm for global optimization

Cited In (3)

• A unification of the stochastic and interval approaches for solution of the global optimization problem for a function
• A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
• Integrated intelligent algorithms for global optimization

Uses Software

• Genocop

This page was built for publication: Combining interval branch and bound and stochastic search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725151)