A branch-and-bound algorithm for a pseudo-Boolean optimization problem with black-box functions

DOI10.22190/FUMI1802337MMaRDI QIDQ3388290zbMATH OpenOpenAlexFDO

Authors Igor S. Masich, Lev A. Kazakovtsev

Publication date 5 May 2021

Published in Facta Universitatis, Series: Mathematics and Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22190/fumi1802337m

zbMATH Keywords

branch-and-bound methodconstrained pseudo-Boolean optimization problempseudo-Boolean optimization problem

Mathematics Subject Classification ID

Boolean programming (90C09) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Pseudo-Boolean optimization
• Minimization of a quadratic pseudo-Boolean function
• scientific article; zbMATH DE number 4162661
• scientific article; zbMATH DE number 45635
• scientific article; zbMATH DE number 1203231

Cites work

• A branch-and-bound algorithm to solve a multi-level network optimization problem
• A finite branch-and-bound algorithm for two-stage stochastic integer programs
• Branch-and-price: Column generation for solving huge integer programs
• Embedding branch and bound within evolutionary algorithms
• scientific article; zbMATH DE number 6183020 (Why is no real title available?)
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 45635 (Why is no real title available?)

Cited in

(2)

• Improving effectiveness of neighborhood-based algorithms for optimization of costly pseudo-Boolean black-box functions
• Merging variables: one technique of search in pseudo-Boolean optimization

This page was built for publication: A branch-and-bound algorithm for a pseudo-Boolean optimization problem with black-box functions

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