Improving effectiveness of neighborhood-based algorithms for optimization of costly pseudo-Boolean black-box functions

DOI10.1007/978-3-030-49988-4_26MaRDI QIDQ2663744zbMATH OpenOpenAlexFDO

Authors Oleg Sergeevich Zaikin, Stepan Kochemazov

Publication date 19 April 2021

Full work available at URL https://doi.org/10.1007/978-3-030-49988-4_26

zbMATH Keywords

black-box optimizationBoolean satisfiability problemcostly functionlocal searchpseudo-Boolean optimization

Mathematics Subject Classification ID

Boolean programming (90C09) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Local search over a generalized neighborhood for an optimization problem of pseudo-Boolean functions
• A branch-and-bound algorithm for a pseudo-Boolean optimization problem with black-box functions
• Black-box search by unbiased variation
• Merging variables: one technique of search in pseudo-Boolean optimization
• A stochastic adaptive radial basis function algorithm for costly black-box optimization

Cited in

(2)

• Local search over a generalized neighborhood for an optimization problem of pseudo-Boolean functions
• Merging variables: one technique of search in pseudo-Boolean optimization

This page was built for publication: Improving effectiveness of neighborhood-based algorithms for optimization of costly pseudo-Boolean black-box functions

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