B\&B method for discrete partial order and quasiorder optimizations

DOI10.15407/DOPOVIDI2019.01.016MaRDI QIDQ5383041zbMATH OpenOpenAlexFDO

Authors Vladimir I. Norkin

Publication date 19 June 2019

Published in Reports of the National Academy of Sciences of Ukraine (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.15407/dopovidi2019.01.016

zbMATH Keywords

branch-and-bound methoddiscrete optimizationnondominated solutionspartial orderquasiorder

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Programming in abstract spaces (90C48) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Outer branching: how to optimize under partial orders?
• Multi-objective branch and bound
• Optimization problems with interval uncertainty: branch and bound method
• A general branch-and-bound framework for continuous global multiobjective optimization
• Target-oriented branch and bound method for global optimization

Cited in

(2)

• B{\&}B method for discrete partial order optimization
• Outer branching: how to optimize under partial orders?

This page was built for publication: B\&B method for discrete partial order and quasiorder optimizations

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