Combining interval branch and bound and stochastic search

DOI10.1155/2014/861765zbMath1474.90526OpenAlexW2121981570WikidataQ59042121 ScholiaQ59042121MaRDI QIDQ1725151

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

Mathematics Subject Classification ID

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

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On constrained optimization by interval arithmetic and interval order relations
• Interval branch and bound with local sampling for constrained global optimization
• A fast memoryless interval-based algorithm for global optimization
• 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
• Optimal multisections in interval branch-and-bound methods of global optimization
• A new hybrid genetic algorithm for global optimization
• A heuristic rejection criterion in interval global optimization algorithms

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